What does Code-Switching Thresholds and Monolingual Precision conclude, in numbers, about “The Bit Ledger and the Degree of a Lexical Gap”?
Answer: The corrected bit ledger adds code length and residual ambiguity. Under the illustrative parameters, two of the six gap words are longer in code length when inserted, yet five are cheaper on the full account and only one is more expensive; the bits saved range from +1.33 to +7.22. Gap degree can be measured as the feature mismatch of the nearest word, but the depth of a gap and the benefit of insertion do not move together: it also matters how many similar concepts surround the nearest word. Each language trades simplicity against precision, gaps arise from those trades, and a bilingual speaker can borrow the category boundaries of another language to cut meaning more finely.
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: 1.33, 7.22
| item | Lm | Le | Hm | He | Tm | Te | Le/Lm | Te/Tm |
|---|---|---|---|---|---|---|---|---|
| kiasu | 19.99 | 14.97 | 2.6 | 0.4 | 22.59 | 15.37 | 0.749 | 0.680 |
| lepak | 14.08 | 14.55 | 2.1 | 0.3 | 16.18 | 14.85 | 1.033 | 0.918 |
| paiseh | 14.95 | 13.55 | 1.8 | 0.5 | 16.75 | 14.05 | 0.906 | 0.839 |
| shiok | 10.44 | 15.14 | 1.5 | 0.6 | 11.94 | 15.74 | 1.450 | 1.318 |
| sajiao | 22.41 | 17.29 | 2.4 | 0.7 | 24.81 | 17.99 | 0.772 | 0.725 |
| yuanfen | 18.08 | 16.29 | 2.9 | 0.9 | 20.98 | 17.19 | 0.901 | 0.819 |
| bits saved for a listener who knows the word (Tm - Te): | ||||||||
| kiasu +7.22 | lepak +1.33 | paiseh +2.70 | ||||||
| shiok -3.80 | sajiao +6.82 | yuanfen +3.80 |
Show the full program
# Chapter 3. p31: code length plus residual ambiguity, six lexical gaps.
# Lm: bits of a monolingual circumlocution under the listener's bigram
# model (product of the listed token probabilities). Le: bits of the
# inserted word, -log2 P(word | shared bilingual lexicon), plus 2 bits of
# switch cue (in and out). Hm, He: residual ambiguity, the expected bits
# still needed to pin the intended sense after each rendering. Every
# probability is an illustrative parameter, not a corpus estimate.
import math
ITEMS = [
# name, circumlocution token probabilities, P(word), Hm, He
("kiasu", [0.05, 0.10, 0.04, 0.08, 0.06], 1 / 8000, 2.6, 0.4),
("lepak", [0.08, 0.12, 0.06, 0.10], 1 / 6000, 2.1, 0.3),
("paiseh", [0.10, 0.07, 0.09, 0.05], 1 / 3000, 1.8, 0.5),
("shiok", [0.12, 0.06, 0.10], 1 / 9000, 1.5, 0.6),
("sajiao", [0.03, 0.05, 0.04, 0.06, 0.05], 1 / 40000, 2.4, 0.7),
("yuanfen", [0.05, 0.04, 0.03, 0.06], 1 / 20000, 2.9, 0.9),
]
CUE = 2.0
def lengths(item):
name, toks, pw, hm, he = item
lm = math.fsum(-math.log2(p) for p in toks)
le = -math.log2(pw) + CUE
return lm, le, hm, he
if __name__ == "__main__":
print("item Lm Le Hm He Tm Te Le/Lm Te/Tm")
for it in ITEMS:
lm, le, hm, he = lengths(it)
tm, te = lm + hm, le + he
print("{:<7} {:>6.2f} {:>6.2f} {:>4.1f} {:>4.1f} {:>6.2f} {:>6.2f}"
" {:>6.3f} {:>6.3f}".format(it[0], lm, le, hm, he, tm, te,
le / lm, te / tm))
gains = []
for it in ITEMS:
lm, le, hm, he = lengths(it)
gains.append((lm + hm) - (le + he))
print("bits saved for a listener who knows the word (Tm - Te):")
print(" " + " ".join("{} {:+.2f}".format(it[0], g)
for it, g in zip(ITEMS[:3], gains[:3])))
print(" " + " ".join("{} {:+.2f}".format(it[0], g)
for it, g in zip(ITEMS[3:], gains[3:])))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 3: The Bit Ledger and the Degree of a Lexical Gap. 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 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 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