What does Lexical Coverage and the Limits of Fast Tracks conclude, in numbers, about “The Zipf Curve: Closed Forms for Cumulative Coverage and the Inverse Problem of List Size”?
Answer: Chapter 2 derives the closed form for harmonic numbers and a ratio formula for power-law tails, and fits a Zipf-Mandelbrot reference curve through two published anchors, on which two thousand families cover about 0.8618.
Scope of the numbers: Its parameters are illustrative and all calculations are generated by its programs. It is general reference material for owners and teachers, not business advice for any person or firm, and it promises no fluency from any course within any period.
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.8618
| anchors | 95 % at 4500 families, 98 % at 8000 families |
| V s q C(1000) C(2000) n90 n99 | |
| 15000 | 1.884 256.0 0.7755 0.8774 2456 10515 |
| 20000 | 2.389 664.5 0.7266 0.8618 2647 11158 |
| 30000 | 2.698 963.9 0.7031 0.8537 2726 11637 |
| 50000 | 2.836 1106.6 0.6939 0.8504 2756 11882 |
| sensitivity at V | 20000: move the anchors inside their ranges |
| 95 % at 4000, 98 % at 8000: s | 1.915 C(2000) = 0.8973 |
| 95 % at 5000, 98 % at 8000: s | 3.224 C(2000) = 0.8087 |
| 95 % at 4500, 98 % at 9000: s | 1.769 C(2000) = 0.8902 |
Show the full program
# Chapter 2. p23: a Zipf-Mandelbrot curve through the two published anchors
# Model: f(r) proportional to (r + q)^(-s) for word families r = 1..V.
# Coverage C(n) = S(n) / S(V), with S(n) = sum_{r<=n} (r + q)^(-s)
# computed exactly for r <= 20 and by Euler-Maclaurin beyond. For each
# illustrative family universe V we solve for (s, q) so that the curve
# passes through Laufer and Ravenhorst-Kalovski's anchors, 95 % at the
# midpoint 4500 families and 98 % at 8000 families, then read off what
# the curve implies for 1000 and 2000 families and for 99 %.
import math
def partial(n, s, q):
m = min(n, 20)
head = [(r + q) ** (-s) for r in range(1, m + 1)]
if n <= 20:
return math.fsum(head)
a, b = 20 + q, n + q
if abs(s - 1.0) < 1e-12:
integ = math.log(b / a)
else:
integ = (a ** (1 - s) - b ** (1 - s)) / (s - 1)
ends = 0.5 * (b ** (-s) - a ** (-s))
slope = -s * (b ** (-s - 1) - a ** (-s - 1)) / 12.0
return math.fsum(head + [integ, ends, slope])
def cover(n, s, q, v):
return partial(n, s, q) / partial(v, s, q)
def q_for(s, v, n2, c2):
lo, hi = 0.0, 20000.0
for _ in range(90):
mid = 0.5 * (lo + hi)
if cover(n2, s, mid, v) > c2:
lo = mid
else:
hi = mid
return 0.5 * (lo + hi)
def fit(v, n1=4500, c1=0.95, n2=8000, c2=0.98):
lo, hi = 1.0, 8.0
for _ in range(70):
s = 0.5 * (lo + hi)
q = q_for(s, v, n2, c2)
if cover(n1, s, q, v) > c1:
lo = s
else:
hi = s
s = 0.5 * (lo + hi)
return s, q_for(s, v, n2, c2)
def words_for(c, s, q, v):
lo, hi = 1, v
while hi - lo > 1:
mid = (lo + hi) // 2
if cover(mid, s, q, v) >= c:
hi = mid
else:
lo = mid
return hi
if __name__ == "__main__":
print("anchors: 95 % at 4500 families, 98 % at 8000 families")
print(" V s q C(1000) C(2000) n90 n99")
for v in (15000, 20000, 30000, 50000):
s, q = fit(v)
print(" {:5d} {:5.3f} {:7.1f} {:.4f} {:.4f} {:5d} {:5d}"
.format(v, s, q, cover(1000, s, q, v),
cover(2000, s, q, v), words_for(0.90, s, q, v),
words_for(0.99, s, q, v)))
print("sensitivity at V = 20000: move the anchors inside their ranges")
for n1, n2 in ((4000, 8000), (5000, 8000), (4500, 9000)):
s, q = fit(20000, n1=n1, n2=n2)
print(" 95 % at {}, 98 % at {}: s = {:.3f} C(2000) = {:.4f}"
.format(n1, n2, s, cover(2000, s, q, 20000)))Single source and citation
Fan, Y. (2026). The 98% Lexical-Coverage Threshold, Zipfian Frequency Curves and Fast-Track Limits for Malay and Hokkien Learners (Version 1.0.0), Chapter 2: The Zipf Curve: Closed Forms for Cumulative Coverage and the Inverse Problem of List Size. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-228 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026228,
author = {Fan, Yafu},
title = {The 98% Lexical-Coverage Threshold, Zipfian Frequency Curves and Fast-Track Limits for Malay and Hokkien Learners},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Ninety-Eight Per Cent: the Original Evidence for a Coverage Threshold and Its Limits
- Chapter 3 · How to Count a Word: Forms, Lemmas, Families and Malay Affixes
- Chapter 4 · Page by Page: How Coverage Varies Across Pages and Where a Narrow Domain List Stops
- Chapter 5 · Forgetting and Review: Half-Life Regression and an Honest Timetable
- Chapter 6 · Malay and Hokkien: the Structural Limits of Fast-Track Promises
- Chapter 7 · Classical Sources East and West: the Grouping of the Erya and Comenius's Orbis Pictus
- Chapter 8 · Closing the Loop: Customer-Service Word Lists, Team Learning Plans and How to Refute This Book