What does Code-Switching Thresholds and Monolingual Precision conclude, in numbers, about “Classical Sources: Yan Fu's Three Difficulties, Confucius on Names, Jerome's Sense for Sense and Schleiermacher's Two Paths”?
Answer: Of the seven renderings, four are Pareto-optimal, in the sense that no other rendering beats them on every score: the literal rendering, the borrowed-sense compound, the full-coverage construction and plain insertion. The word-for-word rendering wins on nothing. Its xin is 0.800, its da only 0.587 and its ya only 0.40, and it is beaten on every score by the construction with a moved pragmatic marker. Plain insertion has a da of 0.767, but its xin is only 0.820, because more than one reader in ten does not know the word. Under the Yan Fu rule, among renderings whose da clears 0.6, the one with the highest xin is the full-coverage construction hyper+, with xin of 1.000, da of 0.670 and ya of 0.95. An equally weighted average of the three scores picks the same rendering, with a mean of 0.873.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs; nothing corresponds to a real customer, conversation or sale, and Malay, Hokkien, Cantonese, English and Mandarin are treated as equals. This is not linguistic doctrine and not business advice to any individual or company.
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.40, 0.587, 0.6, 0.670, 0.767, 0.800
| rendering | xin | da | ya | pareto |
|---|---|---|---|---|
| literal | 0.400 | 0.936 | 1.00 | yes |
| compound | 0.600 | 0.875 | 1.00 | yes |
| marker | 0.800 | 0.717 | 1.00 | no |
| hyper+ | 1.000 | 0.670 | 0.95 | yes |
| word-for-word | 0.800 | 0.587 | 0.40 | no |
| insert | 0.820 | 0.767 | 1.00 | yes |
| insert+gloss | 0.964 | 0.648 | 0.90 | no |
| Yan Fu rule (da >= 0.6, then xin, then ya): hyper+ | ||||
| equal weights instead: hyper+ (mean 0.873) |
Show the full program
# Chapter 7. p71: Yan Fu's three difficulties as three scores.
# Renderings of "kiasu" for a reader group with coverage p = 0.82.
# xin (fidelity) = expected feature coverage; da (getting through) =
# decode probability * exp(-length / 30); ya (elegance) = 1 minus a
# translationese penalty. Coverage and lengths come from p61; the
# word-for-word line is a hard literal rendering of an English gloss.
# Yan Fu rule: keep renderings with da >= 0.6 ("a translation that does
# not get through is no translation"), then maximise xin, then ya.
import math
P = 0.82
CANDS = [
# name, coverage if understood, length, decode prob, ya
("literal", 0.40, 2, 1.0, 1.00),
("compound", 0.60, 4, 1.0, 1.00),
("marker", 0.80, 10, 1.0, 1.00),
("hyper+", 1.00, 12, 1.0, 0.95),
("word-for-word", 0.80, 16, 1.0, 0.40),
("insert", 1.00, 2, P, 1.00),
("insert+gloss", 1.00, 13, 1.0, 0.90),
]
def scores(c):
name, cov, ln, dec, ya = c
if name == "insert":
xin = dec * cov
elif name == "insert+gloss":
xin = P * cov + (1 - P) * 0.80
else:
xin = cov
da = dec * math.exp(-ln / 30.0)
return xin, da, ya
def dominated(a, others):
for b in others:
if b != a and all(x >= y for x, y in zip(b, a)) and b != a:
if any(x > y for x, y in zip(b, a)):
return True
return False
if __name__ == "__main__":
s = {c[0]: scores(c) for c in CANDS}
vals = list(s.values())
print("rendering xin da ya pareto")
for name, v in s.items():
print("{:<14} {:>5.3f} {:>6.3f} {:>6.2f} {}".format(
name, v[0], v[1], v[2], "no" if dominated(v, vals) else "yes"))
ok = [(v[0], v[2], n) for n, v in s.items() if v[1] >= 0.6]
pick = max(ok)
print("Yan Fu rule (da >= 0.6, then xin, then ya): {}".format(pick[2]))
eq = max((math.fsum(v) / 3, n) for n, v in s.items())
print("equal weights instead: {} (mean {:.3f})".format(eq[1], eq[0]))Single source and citation
Fan, Y. (2026). Information Theory of Code-Switching, Lexical-Gap Compensation and Monolingual Precision Equivalence in Multilingual Markets (Version 1.0.0), Chapter 7: Classical Sources: Yan Fu's Three Difficulties, Confucius on Names, Jerome's Sense for Sense and Schleiermacher's Two Paths. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-381 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026381,
author = {Fan, Yafu},
title = {Information Theory of Code-Switching, Lexical-Gap Compensation and Monolingual Precision Equivalence in Multilingual Markets},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Not Laziness: Switch Points Obey Two Grammars
- Chapter 2 · The Information at a Switch Point: Surprisal, Word Length and Uniform Density
- Chapter 3 · The Bit Ledger and the Degree of a Lexical Gap
- Chapter 4 · The Audience-Coverage Threshold: When an Inserted Word Becomes a Decoding Failure
- Chapter 5 · An Upper Bound on Insertion Density, and the Register Signal
- Chapter 6 · Monolingual Constructional Equivalence: Precision Without Insertion
- Chapter 8 · Field Tools and Checker Specifications: the Insertion Ledger, Four-Kit Checkers and a Pre-registered Test