What does Computing Native Chinese Copy conclude, in numbers, about “Chains of De and Stacked Modifiers: an Exact Account of the Left-Branching Burden”?
Answer: Chapter 2 proves that the dependency length of stacked modifiers grows roughly with the square of the layers, so that at four layers the illustrative probability of keeping every relation is only 0.098.
Scope of the numbers: Its example sentences and parameters are illustrative; all calculations are generated by its programs; it is not individual legal, advertising-compliance or marketing advice, and it discusses only persuasion that keeps the rules. Chapter 2 proves that the dependency length of stacked modifiers grows roughly with the square of the layers, so that at four layers the illustrative probability of keeping every relation is only 0.098.
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.098
| m = 3 words per modifier, r = 0.93 | ||||
| k | stacked: DL max MDD keep | topic-first: DL max MDD keep | ||||
| 1 | | 6 | 2 1.500 0.865 | | 6 | 3 2.00 0.804 |
| 2 | | 16 | 6 2.000 0.560 | | 12 | 3 2.00 0.647 |
| 3 | | 30 | 10 2.500 0.271 | | 18 | 3 2.00 0.520 |
| 4 | | 48 | 14 3.000 0.098 | | 24 | 3 2.00 0.419 |
| 5 | | 70 | 18 3.500 0.027 | | 30 | 3 2.00 0.337 |
| 6 | | 96 | 22 4.000 0.005 | | 36 | 3 2.00 0.271 |
| at k = 4: stacked keeps 0.098, topic-first keeps 0.419 | ||||
Show the full program
# Chapter 2. p22: Why stacked pre-nominal modifiers hurt. A noun phrase
# with k modifiers, each of m words plus 的, all hanging on one head noun
# ("[w w M 的] [w w M 的] N"), against a topic-first rewrite in which the
# noun comes first and the k modifiers become k short clauses chained one
# after another ("N, w w M, w w M").
# Both trees are built explicitly and measured with the same function.
# Retention: each intervening word keeps the pending link with
# probability r = 0.93 (an illustrative decay, not a measured constant);
# P(all links kept) is the product over arcs of r ** (distance - 1).
import math
R = 0.93
M = 3
def stacked(k, m):
heads, pos = {}, 0
noun = k * (m + 1) + 1
for _ in range(k):
first = pos + 1
mhead = first + m - 1
for w in range(first, mhead):
heads[w] = mhead
heads[mhead] = noun
heads[mhead + 1] = mhead # 的 attaches to its modifier
pos = mhead + 1
heads[noun] = 0
return heads
def topic_first(k, m):
heads = {1: 0}
prev, pos = 1, 1
for _ in range(k):
first = pos + 1
mhead = first + m - 1
for w in range(first, mhead):
heads[w] = mhead
heads[mhead] = prev
prev, pos = mhead, mhead
return heads
def measure(heads):
d = [abs(a - b) for a, b in heads.items() if b]
keep = math.exp(math.fsum((x - 1) * math.log(R) for x in d))
return math.fsum(d), max(d), math.fsum(d) / len(d), keep
print("m = {} words per modifier, r = {}".format(M, R))
print(" k | stacked: DL max MDD keep | topic-first: DL max MDD keep")
for k in range(1, 7):
a = measure(stacked(k, M))
b = measure(topic_first(k, M))
print("{:>2} | {:>11.0f} {:>4} {:>5.3f} {:>5.3f} | {:>15.0f} {:>3}"
" {:>4.2f} {:>5.3f}".format(k, a[0], a[1], a[2], a[3],
b[0], b[1], b[2], b[3]))
k = 4
a, b = measure(stacked(k, M)), measure(topic_first(k, M))
print("at k = {}: stacked keeps {:.3f}, topic-first keeps {:.3f}"
.format(k, a[3], b[3]))Single source and citation
Fan, Y. (2026). Native Cross-Context Prosody, De-Translationese Syntax-Tree Rewriting and a Conversion Corpus of Malaysian, Singaporean and Taiwanese Chinese (Version 1.0.0), Chapter 2: Chains of De and Stacked Modifiers: an Exact Account of the Left-Branching Burden. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-144 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026144,
author = {Fan, Yafu},
title = {Native Cross-Context Prosody, De-Translationese Syntax-Tree Rewriting and a Conversion Corpus of Malaysian, Singaporean and Taiwanese Chinese},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Dependency Distance: Why Europeanised Long Sentences Are Hard to Read
- Chapter 3 · Fingerprints of Translationese: Ten Machine-Checkable Markers and a Poisson Likelihood-Ratio Test
- Chapter 4 · Rewriting the Tree: Three Operations and the Long-Outside Ordering Theorem
- Chapter 5 · Prosody and Breath: Segment Lengths, Dynamic Programming for Commas, and the Rhythm of Fours and Sixes
- Chapter 6 · Converting Between Malaysian, Singaporean, Taiwanese and Hong Kong Chinese: a Lexicon, an Affinity Matrix and a Library of Closing Sentences
- Chapter 7 · The Classics Examined: Sentences and Pruning in the Wenxin Diaolong, and Orwell's Six Rules
- Chapter 8 · Practice and Refutation: the Persuasive-Copy Checker, a Ceiling on Private Follow-Ups, and a Pre-Registered Test