关于「校对的下限与白名单门禁」,《计算著作学与自校验专著》给出的定量结论是什么?
结论:第五章说明可见度各不相同时,三遍人工校对后仍剩 0.14950 的错误,而白名单抓不到真实数字之间的调换。
数据口径:书中的读者、书、错误率与成本均为示意模型;全部计算由书中程序生成;本书不是法律、财务或出版建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.14950
| passes | equal p=0.70 | Beta(1.4,0.6) | Beta(0.7,0.3) | MC(0.7,0.3) |
| 1 | 0.30000 | 0.30000 | 0.30000 | 0.29907 |
| 2 | 0.09000 | 0.16000 | 0.19500 | 0.19368 |
| 3 | 0.02700 | 0.10400 | 0.14950 | 0.14975 |
| 5 | 0.00243 | 0.05741 | 0.10607 | 0.10545 |
| 10 | 0.00001 | 0.02401 | 0.06600 | 0.06582 |
| errors left of 81 after | 3 passes: equal 2.19, Beta(0.7,0.3) 12.11 | |||
| errors left of 81 after 10 passes: equal 0.00, Beta(0.7,0.3) 5.35 |
查看完整验算程序
# Chapter 5. p09: Why human proofreading has a floor. Each error has its
# own detectability p; a pass finds it with chance p. If every error had
# p = 0.70, k passes would leave 0.30^k. But errors differ: with p drawn
# from Beta(a, b) of the same mean 0.70, the share missed after k passes
# is B(a, b + k) / B(a, b), which falls only like k^-a. Draft: 81 wrong
# numbers (450 at 0.18). We also print a Monte Carlo of the Beta case
# (Johnk's sampler, built on random() alone), fixed seed 101.
import random
from math import lgamma, exp
rng = random.Random(101)
def beta_miss(a, b, k):
lb = lambda x, y: lgamma(x) + lgamma(y) - lgamma(x + y)
return exp(lb(a, b + k) - lb(a, b))
def johnk(a, b):
while True:
x = rng.random() ** (1 / a)
y = rng.random() ** (1 / b)
if 0 < x + y <= 1:
return x / (x + y)
def mc_miss(a, b, k, n=200000):
left = 0
for _ in range(n):
p = johnk(a, b)
if all(rng.random() > p for _ in range(k)):
left += 1
return left / n
if __name__ == "__main__":
print(" passes equal p=0.70 Beta(1.4,0.6) Beta(0.7,0.3)"
" MC(0.7,0.3)")
for k in (1, 2, 3, 5, 10):
print(" {:6d} {:12.5f} {:13.5f} {:13.5f} {:11.5f}".format(
k, 0.3 ** k, beta_miss(1.4, 0.6, k), beta_miss(0.7, 0.3, k),
mc_miss(0.7, 0.3, k)))
for k in (3, 10):
print(" errors left of 81 after {:2d} passes: equal {:.2f},"
" Beta(0.7,0.3) {:.2f}".format(k, 81 * 0.3 ** k,
81 * beta_miss(0.7, 0.3, k)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《计算著作学、先证伪后立界修辞与自校验专著编译器》第 5 章「校对的下限与白名单门禁」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-101 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026101,
author = {Fan, Yafu},
title = {Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}