What does Code-Switching Thresholds and Monolingual Precision conclude, in numbers, about “Monolingual Constructional Equivalence: Precision Without Insertion”?
Answer: The third popular belief holds that a writer who must stay in Chinese or in English can only choose between a loss of precision and translationese. The non-equivalence strategies of translation studies, dynamic equivalence and the oblique procedures, together with the argument of construction grammar that constructions carry meaning of their own, give a third route: recombination at the level of the phrase. Once precision is written as feature coverage, all three gap concepts in the illustrative examples reach a coverage of 0.80 with monolingual constructions of four to twelve units. Exhaustive search finds skeletons shorter than greedy or hand-written candidates, and rebuilt versions can bring the translationese markers down to zero. The price is length, and what it buys is a text everyone understands.
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. printed values that match the answer: 0.80, 12
| kiasu: strategy | coverage | length |
|---|---|---|
| literal | 0.40 | 2 |
| compound | 0.60 | 4 |
| hyper | 0.60 | 7 |
| quant | 0.40 | 8 |
| marker | 0.80 | 10 |
| hyper+ | 1.00 | 12 |
| shortest at >= 0.8: marker (10 units, coverage 0.80); full: 12 units | ||
| lepak: strategy | coverage | length |
| literal | 0.40 | 2 |
| compound | 0.60 | 4 |
| hyper | 0.80 | 7 |
| marker | 1.00 | 9 |
| shortest at >= 0.8: hyper (7 units, coverage 0.80); full: 9 units | ||
| sajiao: strategy | coverage | length |
| literal | 0.40 | 2 |
| hyper | 0.60 | 3 |
| marker | 0.80 | 4 |
| compound | 0.80 | 6 |
| hyper+ | 1.00 | 8 |
| shortest at >= 0.8: marker (4 units, coverage 0.80); full: 8 units |
Show the full program
# Chapter 6. p61: monolingual constructions that stand in for a loanword.
# Each target concept has five semantic features. A candidate rendering
# covers some of them and costs a length (hanzi for Chinese renderings,
# words for the English one). Rule: take the shortest candidate whose
# feature coverage is at least 0.8; report the full-coverage one too.
# Strategies: literal, hyper (hypernym + qualifier), compound (borrowed
# sense compound), marker (pragmatic marker moved), quant (quantified).
# Features, renderings and lengths are illustrative.
TARGET = {
"kiasu": {"fear_loss", "compete", "over_prepare", "anxious", "early"},
"lepak": {"idle", "relaxed", "social", "outdoor", "unhurried"},
"sajiao": {"coy", "petulant", "indulge", "affection", "playful"},
}
CANDS = {
"kiasu": [
("literal", {"fear_loss", "compete"}, 2),
("compound", {"fear_loss", "compete", "anxious"}, 4),
("hyper", {"fear_loss", "compete", "early"}, 7),
("quant", {"over_prepare", "fear_loss"}, 8),
("marker", {"fear_loss", "over_prepare", "early", "anxious"}, 10),
("hyper+", {"fear_loss", "compete", "over_prepare", "anxious",
"early"}, 12),
],
"lepak": [
("literal", {"idle", "relaxed"}, 2),
("compound", {"idle", "relaxed", "social"}, 4),
("hyper", {"idle", "relaxed", "social", "outdoor"}, 7),
("marker", {"idle", "relaxed", "social", "outdoor",
"unhurried"}, 9),
],
"sajiao": [
("literal", {"coy", "playful"}, 2),
("hyper", {"petulant", "indulge", "playful"}, 3),
("marker", {"petulant", "indulge", "playful", "coy"}, 4),
("compound", {"coy", "affection", "petulant", "indulge"}, 6),
("hyper+", {"coy", "petulant", "indulge", "affection",
"playful"}, 8),
],
}
if __name__ == "__main__":
for c, cands in CANDS.items():
tgt = TARGET[c]
print("{}: strategy coverage length".format(c))
rows = []
for name, feats, ln in cands:
cov = len(feats & tgt) / len(tgt)
rows.append((cov, ln, name))
print(" {:<12} {:>8.2f} {:>7}".format(name, cov, ln))
ok = sorted((ln, name, cov) for cov, ln, name in rows if cov >= 0.8)
full = sorted((ln, name) for cov, ln, name in rows if cov >= 1.0)
print(" shortest at >= 0.8: {} ({} units, coverage {:.2f});"
" full: {} units".format(ok[0][1], ok[0][0], ok[0][2],
full[0][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 6: Monolingual Constructional Equivalence: Precision Without Insertion. 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 7 · Classical Sources: Yan Fu's Three Difficulties, Confucius on Names, Jerome's Sense for Sense and Schleiermacher's Two Paths
- Chapter 8 · Field Tools and Checker Specifications: the Insertion Ledger, Four-Kit Checkers and a Pre-registered Test