What does Etymology, Parataxis and the Two-Track Transfer conclude, in numbers, about “The Two-Track Transfer: the Largest Gap That Survives an English Traceability Constraint”?

Answer: Between spelling out everything and juxtaposing everything lies a frontier that can be computed. Under a traceability of at least 0.90, Wen Tingyun's couplet keeps at most 0.314 of its gap and the opening of the Analects 0.371. The clause effect s sets the position of the frontier; at an s of 0.7 the gap kept reaches 0.514. The optimum sits right on the red line and holds it with a probability of only 0.598 under perturbation, so plans need a margin.

Scope of the numbers: Anachronistic reading yields an illustrative 1.307 expected misreadings per thousand graphs, and with only three faulty sentences a checker must read 0.632 of a manuscript. Parameters are illustrative and all calculations come from the book's 23 programs.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.314, 0.514, 0.598, 0.7, 0.90

thresholds=0.3s=0.5s=0.7
0.800.5710.6290.771
0.850.4290.4860.657
0.900.2860.3140.514
0.950.0860.0860.171
nominal plan CSSCCJC under perturbation: P(trace>=0.90) 0.598
trace 5th pct 0.874, median 0.905, 95th pct 0.934
Show the full program
# Chapter 5. p53: the trace-gap frontier and how fragile it is
# Part A: for the Wen couplet modes (p41), the largest gap kept at each
# trace threshold, for three values of the semicolon uplift s (the share
# of residual confusion an independent-clause rendering removes; p51
# uses 0.5). Part B: perturb every modal share by a multiplicative
# log-normal factor (sigma 0.15, capped at 0.95), 2,000 fixed-seed
# draws, and count how often the nominal 0.90 plan still reaches 0.90.
import math
import random
from itertools import product

MODES = [0.45, 0.60, 0.70, 0.65, 0.60, 0.80, 0.55]
GAP = {"J": 1.0, "S": 0.6, "C": 0.0}


def trace(dev, m, s):
    if dev == "J":
        return m
    if dev == "S":
        return m + s * (1 - m)
    return 0.97


def frontier(modes, tmin, s):
    best = None
    for plan in product("JSC", repeat=len(modes)):
        t = math.fsum(trace(d, m, s) for d, m in zip(plan, modes))
        t /= len(modes)
        if t + 1e-12 < tmin:
            continue
        g = math.fsum(GAP[d] for d in plan) / len(modes)
        if best is None or g > best[0] + 1e-12:
            best = (g, "".join(plan))
    return best


print("threshold   s=0.3   s=0.5   s=0.7")
for tmin in (0.80, 0.85, 0.90, 0.95):
    cells = []
    for s in (0.3, 0.5, 0.7):
        g, _ = frontier(MODES, tmin, s)
        cells.append("{:.3f}".format(g))
    print("  {:.2f}      {}".format(tmin, "   ".join(cells)))
rng = random.Random(38253)
plan = "CSSCCJC"
ok = 0
ts = []
for _ in range(2000):
    mm = [min(0.95, m * math.exp(rng.gauss(0.0, 0.15))) for m in MODES]
    t = math.fsum(trace(d, m, 0.5) for d, m in zip(plan, mm)) / 7
    ts.append(t)
    if t >= 0.90:
        ok += 1
ts.sort()
print("nominal plan {} under perturbation: P(trace>=0.90) {:.3f}"
      .format(plan, ok / 2000))
print("trace 5th pct {:.3f}, median {:.3f}, 95th pct {:.3f}".format(
    ts[99], ts[999], ts[1899]))

Single source and citation

Fan, Y. (2026). Classical Chinese Etymological Philology, Paratactic Imagery Topology and East-West Aesthetic Asymmetry in High-Authority Writing (Version 1.0.0), Chapter 5: The Two-Track Transfer: the Largest Gap That Survives an English Traceability Constraint. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-382 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026382,
  author    = {Fan, Yafu},
  title     = {Classical Chinese Etymological Philology, Paratactic Imagery Topology and East-West Aesthetic Asymmetry in High-Authority Writing},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book