What does Lexical Coverage and the Limits of Fast Tracks conclude, in numbers, about “Forgetting and Review: Half-Life Regression and an Honest Timetable”?
Answer: Chapter 5 schedules review with half-life regression: a "ninety-day fast track" reaches a coverage of only 0.8050, and half an hour a day takes 500 days to reach eight thousand families.
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.8050, 500
| new/day | min/day | days to 2000 | to 4500 | to 8000 | cov 90 d | cov 365 d |
| 10 | 15.3 | 250 | 563 | 1000 | 0.6445 | 0.9114 |
| 20 | 30.7 | 125 | 282 | 500 | 0.8050 | 0.9661 |
| 40 | 61.3 | 63 | 141 | 250 | 0.9099 | 0.9911 |
| a '90-day' plan at 20 a day: 1440 families, coverage 0.8050, | ||||||
| i.e. one unknown word in 5.1 running words |
Show the full program
# Chapter 5. p53: an honest timeline from words a day to coverage
# A plan introduces N new families a day; a share G = 0.8 of them
# (illustrative) end up known for reading. Known families after t days
# are G N t. Coverage is read off the reference family curve of p23
# (V = 20000, s = 2.389, q = 664.5); daily minutes come from the day-180
# load of p52 (8 s a review, 20 s a new item, about 9 reviews a word).
# Targets: 2000 families, 4500 (95 % anchor) and 8000 (98 % anchor).
import math
V, S, Q, G = 20000, 2.389, 664.5, 0.8
REVIEWS, SEC_REV, SEC_NEW = 9, 8, 20
def partial(n, s, q):
return math.fsum([(r + q) ** (-s) for r in range(1, n + 1)])
TOTAL = partial(V, S, Q)
def cover(n):
return partial(min(int(n), V), S, Q) / TOTAL
if __name__ == "__main__":
print("new/day min/day days to 2000 to 4500 to 8000"
" cov 90 d cov 365 d")
for n in (10, 20, 40):
mins = (n * REVIEWS * SEC_REV + n * SEC_NEW) / 60.0
days = [math.ceil(t / (G * n)) for t in (2000, 4500, 8000)]
print(" {:5d} {:7.1f} {:12d} {:7d} {:7d} {:8.4f} {:9.4f}"
.format(n, mins, days[0], days[1], days[2],
cover(G * n * 90), cover(G * n * 365)))
known = G * 20 * 90
print("a '90-day' plan at 20 a day: {:.0f} families, coverage {:.4f},"
.format(known, cover(known)))
print(" i.e. one unknown word in {:.1f} running words".format(
1.0 / (1.0 - cover(known))))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 5: Forgetting and Review: Half-Life Regression and an Honest Timetable. 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 2 · The Zipf Curve: Closed Forms for Cumulative Coverage and the Inverse Problem of List Size
- 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 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