What does Etymology, Parataxis and the Two-Track Transfer conclude, in numbers, about “Ambiguity Entropy: the Distribution of Readings on Each Juxtaposition Edge and the Burden on Readers”?

Answer: Once the distribution of readings is counted, the ambiguity of a paratactic sentence acquires a value. The opening passage of the Analects carries 8.273 bits and Wen Tingyun's couplet 7.806 bits, 1.182 and 1.115 bits per edge respectively. The probability that two readers agree on the whole sentence is below one in a hundred, and a pair disagrees on more than three edges on average. The most valuable place for an added function word is the edge of highest entropy; by the third added word only 0.571 of the gap remains.

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: 1.115, 1.182, 7.806, 8.273

max per edge: log2(5)2.32 bits
Lunyu 1.1
learn-practise (er)1.219 mode coord marked
practise->glad1.578 mode cond
friends->joy1.369 mode cause
unknown-unvexed (er)0.922 mode contrast marked
unvexed->noble1.361 mode cause
question1-20.748 mode coord
question2-31.076 mode coord
total H 8.273 bits of max 16.25; share 0.509; 2**H309.4
Wen couplet
crow-inn1.539 mode time
inn-moon0.971 mode coord
steps-bridge0.881 mode coord
bridge-frost0.934 mode coord
crow||steps1.353 mode coord
inn||bridge0.722 mode coord
moon||frost1.406 mode coord
total H 7.806 bits of max 16.25; share 0.480; 2**H223.9
per-edge mean: Lunyu 1.182, Wen 1.115
edges above 1.40 bits: Lunyu 1
edges above 1.40 bits: Wen 2
Show the full program
# Chapter 4. p41: ambiguity entropy of each relation edge
# Five relation types: cause, contrast, coordination (incl. co-presence),
# time, condition. Each edge carries the author's illustrative reading
# distribution (to be replaced by reader-panel counts). H(edge) in bits;
# H(sentence) adds edges as if independent; 2 ** H is the number of
# equally likely readings with the same uncertainty.
import math

TYPES = ("cause", "contrast", "coord", "time", "cond")
LUNYU = [
    ("learn-practise (er)", (0.05, 0.00, 0.55, 0.40, 0.00), True),
    ("practise->glad", (0.35, 0.00, 0.05, 0.10, 0.50), False),
    ("friends->joy", (0.45, 0.00, 0.00, 0.10, 0.45), False),
    ("unknown-unvexed (er)", (0.00, 0.80, 0.10, 0.00, 0.10), True),
    ("unvexed->noble", (0.50, 0.00, 0.10, 0.00, 0.40), False),
    ("question1-2", (0.00, 0.05, 0.85, 0.10, 0.00), False),
    ("question2-3", (0.00, 0.25, 0.70, 0.05, 0.00), False),
]
WEN = [
    ("crow-inn", (0.30, 0.00, 0.25, 0.45, 0.00), False),
    ("inn-moon", (0.00, 0.00, 0.60, 0.40, 0.00), False),
    ("steps-bridge", (0.00, 0.00, 0.70, 0.30, 0.00), False),
    ("bridge-frost", (0.00, 0.00, 0.65, 0.35, 0.00), False),
    ("crow||steps", (0.15, 0.00, 0.60, 0.25, 0.00), False),
    ("inn||bridge", (0.00, 0.20, 0.80, 0.00, 0.00), False),
    ("moon||frost", (0.00, 0.15, 0.55, 0.30, 0.00), False),
]


def entropy(p):
    return -math.fsum(x * math.log2(x) for x in p if x > 0)


def table(name, edges):
    print(name)
    hs = []
    for label, p, marked in edges:
        h = entropy(p)
        hs.append(h)
        print("  {:<22}{:>6.3f}  mode {:<6}{}".format(
            label, h, TYPES[p.index(max(p))], "  marked" if marked else ""))
    tot = math.fsum(hs)
    hmax = len(edges) * math.log2(len(TYPES))
    print("  total H {:.3f} bits of max {:.2f}; share {:.3f}; "
          "2**H = {:.1f}".format(tot, hmax, tot / hmax, 2 ** tot))
    return tot


print("max per edge: log2(5) = {:.2f} bits".format(math.log2(5)))
a = table("Lunyu 1.1", LUNYU)
b = table("Wen couplet", WEN)
print("per-edge mean: Lunyu {:.3f}, Wen {:.3f}".format(a / 7, b / 7))
for name, edges in (("Lunyu", LUNYU), ("Wen", WEN)):
    k = 0
    for _, p, _ in edges:
        if entropy(p) > 1.40:
            k += 1
    print("edges above 1.40 bits: {} {}".format(name, k))

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 4: Ambiguity Entropy: the Distribution of Readings on Each Juxtaposition Edge and the Burden on Readers. 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