What does Code-Switching Thresholds and Monolingual Precision conclude, in numbers, about “The Audience-Coverage Threshold: When an Inserted Word Becomes a Decoding Failure”?
Answer: The benefit of insertion is conditional: enough people have to know the word. When monolingual expression, insertion and insertion with a gloss are written as three cost lines in coverage, the illustrative threshold at which insertion breaks even runs from 0.789 to 0.952 in live chat and from 0.844 to 0.967 in written messages; words with a negative precision account never pay, whatever their coverage. The gloss has a transition window for only a few words. When readers do not ask, failures become invisible misreadings, whose risk rises linearly as coverage falls. Words that deserve insertion on regional pages may all fall below threshold once those pages are merged into one mixed page.
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.789, 0.844, 0.952, 0.967
| K = 12 bits | p*(insert vs mono) | gloss best from | insert best from |
| kiasu | 0.789 | 0.773 | 0.801 |
| lepak | 0.952 | none | 0.953 |
| paiseh | 0.904 | none | 0.905 |
| shiok | none | none | none |
| sajiao | 0.811 | none | 0.812 |
| yuanfen | 0.882 | none | 0.882 |
| K = 24 bits | p*(insert vs mono) | gloss best from | insert best from |
| kiasu | 0.844 | 0.773 | 0.876 |
| lepak | 0.967 | none | 0.967 |
| paiseh | 0.933 | none | 0.933 |
| shiok | none | none | none |
| sajiao | 0.858 | 0.846 | 0.865 |
| yuanfen | 0.914 | none | 0.914 |
Show the full program
# Chapter 4. p41: the coverage threshold p* for an inserted word.
# Costs in bits, from p31. A listener who knows the word pays Te; one who
# does not pays Le, then a clarification round worth K bits, then the full
# circumlocution Tm. Monolingual costs Tm for everyone. A gloss of
# Lg = 0.8 Lm bits is skimmed by knowers (a quarter of Lg) and read in
# full by the rest, who then reach the monolingual residual Hm.
# p* = (Le + K) / (G + Le + K) with G = Tm - Te. K is illustrative:
# 12 bits for a live chat, 24 for a written private message.
import math
ITEMS = [
("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 costs(item, k):
name, toks, pw, hm, he = item
lm = math.fsum(-math.log2(p) for p in toks)
le = -math.log2(pw) + CUE
tm, te, lg = lm + hm, le + he, 0.8 * lm
ins = (te, le + k + tm) # (knower, non-knower)
gls = (te + 0.25 * lg, le + lg + hm)
return tm, ins, gls
def cross(a, b):
# p where p*a0 + (1-p)*a1 equals p*b0 + (1-p)*b1; None if parallel
da, db = a[0] - a[1], b[0] - b[1]
if abs(da - db) < 1e-12:
return None
return (b[1] - a[1]) / (da - db)
def choice(item, k, p):
tm, ins, gls = costs(item, k)
opts = [(tm, "mono"), (p * gls[0] + (1 - p) * gls[1], "gloss"),
(p * ins[0] + (1 - p) * ins[1], "insert")]
return min(opts)[1]
def windows(item, k):
# first coverage (step 0.001) at which gloss, then insert, is cheapest
first = {}
for i in range(1001):
c = choice(item, k, i / 1000.0)
first.setdefault(c, i / 1000.0)
return first
def fmt(p):
return " none" if p is None or p > 1.0 else "{:>6.3f}".format(p)
if __name__ == "__main__":
for k in (12.0, 24.0):
print("K = {:.0f} bits p*(insert vs mono) gloss best from"
" insert best from".format(k))
for it in ITEMS:
tm, ins, gls = costs(it, k)
w = windows(it, k)
print(" {:<8} {} {} {}".format(
it[0], fmt(cross(ins, (tm, tm))), fmt(w.get("gloss")),
fmt(w.get("insert"))))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 4: The Audience-Coverage Threshold: When an Inserted Word Becomes a Decoding Failure. 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 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