What does Drift Control for Multi-Window Writing conclude, in numbers, about “The Terminology Graph: Lock Tables, Synonym Drift and Cross-Volume Consistency Audits”?

Answer: Terminology drift has three sources: literal variants, synonym substitution and translation drift. String rulers catch only the first; the second needs aliases registered in the lock table; the third needs the term graph built from Chinese–English pairings. Edit distance weighs heavily on short Chinese terms, where one character's difference in a two-character term leaves a similarity of only 0.500; bigrams must be padded, and English compact keys compared first. On the constructed sample, the two rulers reach only about six in ten precision when recall is near perfect, so they only produce review lists, and automatic verdicts come from the lock table alone. The cross-volume term graph takes components along hard edges only, and soft edges never merge anything automatically; the five audit rules put collisions and translation drift first, and return definition conflicts to the volume that owns the definition. The blast radius of every lock-table change is computed exactly as "uses it and is pinned before the change". The next chapter turns to something else that drifts between windows just as terms do: numbers.

Scope of the numbers: Every error rate without a source is an assumed parameter or a measurement on synthetic data; the book is not legal advice and recommends no writing tool or model. Marked boxes separate published evidence, runnable calculations, sources and the author's hypotheses, each stating what would refute it.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.500

DP table for pair Z5 (rows: prefixes of the 4-character term, columns: of the 5-character term)
row 00 1 2 3 4 5
row 11 0 1 2 3 4
row 22 1 0 1 2 3
row 33 2 1 0 1 2
row 44 3 2 1 1 1
pair (first / second) len d sim
Z1 (Chinese pair)5 1 0.800
Z2 (Chinese pair)5 2 0.600
Z3 (Chinese pair)2 1 0.500
Z4 (Chinese pair)3 1 0.667
Z5 (Chinese pair)5 1 0.800
Z6 (Chinese pair)4 1 0.750
Z7 (Chinese pair)3 2 0.333
Z8 (Chinese pair)4 1 0.750
E1 exclusive-create lock / exclusive create lock21 1 0.952
E2 exclusive-create lock / exclusive lock21 7 0.667
E3 lease / lease term10 5 0.500
E4 heartbeat / heart-beat10 1 0.900
E5 term lock table / term table15 5 0.667
E6 calculation box / hypothesis box15 10 0.333
E7 citation hallucination / citation fabrication22 6 0.727
E8 stale-lock reclamation / stale lock recovery22 9 0.591
one edit on a 2-character term: sim0.500; on a 21-character term: sim = 0.952
swap typo 'term-lcok' vs 'term-lock': Levenshtein 2, OSA 1
Show the full program
# Chapter 3. p30: Levenshtein distance on invented term pairs; one edit weighs more on a short Chinese term.
# Wagner-Fischer dynamic programming: insert, delete, substitute each cost 1. Normalised similarity
# sim = 1 - d / max(len a, len b). The OSA variant also counts one swap of adjacent characters as 1.
# All terms are invented for this book's fictitious series; labels are not used here (see p32).


def lev(a, b):
    prev = list(range(len(b) + 1))
    for i, ca in enumerate(a, 1):
        cur = [i]
        for j, cb in enumerate(b, 1):
            cur.append(min(prev[j] + 1, cur[j - 1] + 1, prev[j - 1] + (ca != cb)))
        prev = cur
    return prev[-1]


def osa(a, b):
    d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)]
    for i in range(len(a) + 1):
        d[i][0] = i
    for j in range(len(b) + 1):
        d[0][j] = j
    for i in range(1, len(a) + 1):
        for j in range(1, len(b) + 1):
            c = a[i - 1] != b[j - 1]
            d[i][j] = min(d[i - 1][j] + 1, d[i][j - 1] + 1, d[i - 1][j - 1] + c)
            if i > 1 and j > 1 and a[i - 1] == b[j - 2] and a[i - 2] == b[j - 1]:
                d[i][j] = min(d[i][j], d[i - 2][j - 2] + 1)
    return d[-1][-1]


def table(a, b):
    rows = [[0] * (len(b) + 1) for _ in range(len(a) + 1)]
    for i in range(len(a) + 1):
        for j in range(len(b) + 1):
            rows[i][j] = lev(a[:i], b[:j])
    return rows


PAIRS = [
    ("独占新建锁", "独占创建锁"), ("独占新建锁", "排他新建锁"), ("租约", "租期"), ("心跳", "心跳包"),
    ("术语锁表", "术语锁定表"), ("术语锁表", "术语表"), ("计算框", "假说框"), ("引文幻觉", "引用幻觉"),
    ("exclusive-create lock", "exclusive create lock"), ("exclusive-create lock", "exclusive lock"),
    ("lease", "lease term"), ("heartbeat", "heart-beat"), ("term lock table", "term table"),
    ("calculation box", "hypothesis box"), ("citation hallucination", "citation fabrication"),
    ("stale-lock reclamation", "stale lock recovery"),
]

if __name__ == "__main__":
    a, b = "术语锁表", "术语锁定表"
    print("DP table for pair Z5 (rows: prefixes of the 4-character term, columns: of the 5-character term)")
    for i, row in enumerate(table(a, b)):
        print("   row {}: {}".format(i, " ".join(str(x) for x in row)))
    print("  pair (first / second)                                  len  d  sim")
    for x, y in PAIRS:
        d = lev(x, y)
        n = max(len(x), len(y))
        k = PAIRS.index((x, y))
        lab = "E{}  {} / {}".format(k - 7, x, y) if x.isascii() else "Z{}  (Chinese pair)".format(k + 1)
        print("  {:<53}  {:>3}  {:>2}  {:.3f}".format(lab, n, d, 1 - d / n))
    print("one edit on a 2-character term: sim = {:.3f}; on a 21-character term: sim = {:.3f}".format(
        1 - 1 / 2, 1 - 1 / 21))
    print("swap typo 'term-lcok' vs 'term-lock': Levenshtein {}, OSA {}".format(
        lev("term-lcok", "term-lock"), osa("term-lcok", "term-lock")))

Single source and citation

Fan, Y. (2026). Drift Control for Parallel Multi-Window Book Writing, Cross-Volume Terminology Graph Audits and Zero-Hallucination Citation Verifiers (Version 0.1.0), Chapter 3: The Terminology Graph: Lock Tables, Synonym Drift and Cross-Volume Consistency Audits. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-152 · v0.1.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026152,
  author    = {Fan, Yafu},
  title     = {Drift Control for Parallel Multi-Window Book Writing, Cross-Volume Terminology Graph Audits and Zero-Hallucination Citation Verifiers},
  year      = {2026},
  publisher = {5D Library},
  edition   = {0.1.0},
  note      = {DOI pending}
}

Other chapter answers in this book