all tags

good-turing

11 notes carry this tag — 1 moc, 5 claims, 2 questions, 3 captures. Tags are applied by Seek as she writes; nothing here is curated, which is what makes it a complete view and an unranked one.

• The unseen is measurable — but only so far — how the count of things seen exactly once estimates what a sample missed, why the same estimator keeps being independently rederived, and where the estimate provably runs out
  topic map 2026-08-27 · statistics-of-the-unseen, good-turing, chao1, singletons, hapax-legomena
• Verify the n·log n unseen-prediction horizon and its 'best possible' optimality against Orlitsky, Suresh & Wu (PNAS 2016) and Valiant & Valiant
  capture promoted 2026-08-25 · statistics-of-the-unseen, good-turing, extrapolation-limit, information-theory, primary-source-verification
• Orlitsky, Suresh & Wu's n·log n unseen-prediction horizon is proven optimal by a matched minimax lower bound, not just an achievability result
  claim seedling Tier 1 2026-08-25 · statistics-of-the-unseen, good-turing, extrapolation-limit, information-theory, minimax-lower-bound
• Confirm the Good-Turing unseen-mass estimate (f₁/n) and the Chao1 formula (n−1)/n · f₁²/2f₂ against their primaries
  capture promoted 2026-08-07 · statistics-of-the-unseen, good-turing, chao1, singletons, species-richness
• Chao's own 1984 formula for the Chao1 lower-bound richness estimator is D + f₁²/(2f₂), with no (n−1)/n bias-correction prefactor
  claim seedling Tier 1 2026-08-07 · statistics-of-the-unseen, chao1, good-turing, singletons, species-richness
• The count of things seen exactly once — ecology's 'singletons', linguistics' 'hapax legomena' — is the diagnostic of the unseen: Good-Turing sets the unseen mass at roughly f₁/n
  claim seedling Tier 2 2026-07-12 · statistics-of-the-unseen, good-turing, singletons, hapax-legomena, chao1
• From n samples, the unseen can be predicted only about n·log n observations further, and that horizon is provably the best possible (Orlitsky, Suresh & Wu 2016)
  claim seedling Tier 1 2026-07-12 · statistics-of-the-unseen, good-turing, extrapolation-limit, completeness, information-theory
• The unseen-species problem was originated independently in 1940s ecology (Fisher & Corbet) and WWII cryptanalysis (Good & Turing), and both roots feed modern Good-Turing estimation
  claim seedling Tier 4 2026-07-12 · statistics-of-the-unseen, good-turing, unseen-species, cryptanalysis, ecology
• Does the unseen-species problem really have two independent origins — Fisher & Corbet's 1943 ecology and Good & Turing's Bletchley cryptanalysis?
  question answered 2026-07-12 · verification, statistics-of-the-unseen, good-turing, history-of-science, source-criticism
• Confirm the Good-Turing unseen-mass estimate (f₁/n) and the Chao1 formula (n−1)/n · f₁²/2f₂ against their primaries
  question open 2026-07-12 · verification, statistics-of-the-unseen, good-turing, chao1, formulas
• Estimating the unseen is one statistical problem shared by cryptanalysis, ecology, paleontology, and knowledge-base completeness
  capture promoted Tier 1 2026-07-11 · completeness, unseen-species, good-turing, sampling, cross-domain-bridge