What does Computing Native Chinese Copy conclude, in numbers, about “Practice and Refutation: the Persuasive-Copy Checker, a Ceiling on Private Follow-Ups, and a Pre-Registered Test”?
Answer: Chapter 8 gives the ten rules of a persuasive-copy checker, a ceiling on private follow-ups (two are best in the illustrative model, worth 0.0648 per enquiring customer), red lines and stopping conditions for vulnerable readers, and a pre-registered conversion trial of 6,745 customers per arm. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.
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.0648
| K | E[buy] | E[stop] | net(W=3) | marginal buy | marginal stop |
| 1 | 0.0800 | 0.0080 | 0.0560 | 0.0800 | 0.0080 |
| 2 | 0.1238 | 0.0197 | 0.0648 | 0.0438 | 0.0117 |
| 3 | 0.1484 | 0.0372 | 0.0368 | 0.0247 | 0.0175 |
| 4 | 0.1625 | 0.0639 | -0.0292 | 0.0141 | 0.0267 |
| 5 | 0.1705 | 0.1045 | -0.1428 | 0.0080 | 0.0406 |
| 6 | 0.1750 | 0.1653 | -0.3208 | 0.0045 | 0.0608 |
| 7 | 0.1775 | 0.2538 | -0.5839 | 0.0025 | 0.0885 |
| net value peaks at K = 2 follow-ups (0.0648 per lead) | |||||
| from follow-up 3 on, W x marginal stop exceeds marginal buy |
Show the full program
# Chapter 8. p83: How many private follow-up messages after an inquiry?
# Model (illustrative parameters, exact arithmetic, no simulation): a
# lead who is still open when follow-up t arrives buys with probability
# c_t = 0.08 * 0.6 ** (t - 1) and asks us to stop (or complains) with
# probability s_t = 0.008 * 1.6 ** (t - 1); otherwise stays open. A stop
# request ends all contact and is recorded. Net value counts a stop or
# complaint as costing W = 3 purchases (lost goodwill, platform penalty).
import math
C0, CD = 0.08, 0.6
S0, SG = 0.008, 1.6
W = 3
def run(k):
open_p, buys, stops, rows = 1.0, [], [], []
for t in range(1, k + 1):
c = C0 * CD ** (t - 1)
s = min(S0 * SG ** (t - 1), 1 - c)
buys.append(open_p * c)
stops.append(open_p * s)
rows.append((t, open_p * c, open_p * s))
open_p *= 1 - c - s
return math.fsum(buys), math.fsum(stops), rows
print(" K E[buy] E[stop] net(W=3) marginal buy marginal stop")
best, prev = None, (0.0, 0.0)
for k in range(1, 8):
b, s, rows = run(k)
net = b - W * s
mb, ms = b - prev[0], s - prev[1]
prev = (b, s)
if best is None or net > best[1]:
best = (k, net)
print("{:>2} {:>8.4f} {:>9.4f} {:>9.4f} {:>13.4f} {:>14.4f}".format(
k, b, s, net, mb, ms))
print("net value peaks at K = {} follow-ups ({:.4f} per lead)".format(*best))
_, _, rows = run(7)
cross = [t for t, mb, ms in rows if mb < W * ms][0]
print("from follow-up {} on, W x marginal stop exceeds marginal buy"
.format(cross))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 8: Practice and Refutation: the Persuasive-Copy Checker, a Ceiling on Private Follow-Ups, and a Pre-Registered Test. 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 2 · Chains of De and Stacked Modifiers: an Exact Account of the Left-Branching Burden
- 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