Strong Consistency of the Good-Turing Estimator

Abstract

We consider the problem of estimating the total probability of all symbols that appear with a given frequency in a string of i.i.d. random variables with unknown distribution. We focus on the regime in which the block length is large yet no symbol appears frequently in the string. This is accomplished by allowing the distribution to change with the block length. Under a natural convergence assumption on the sequence of underlying distributions, we show that the total probabilities converge to a deterministic limit, which we characterize. We then show that the Good-Turing total probability estimator is strongly consistent.

To appear at IEEE ISIT 2006

Cited by in corpus (3)

• On consistent estimation of the missing mass
• STADS: Software Testing as Species Discovery
• A Better Good-Turing Estimator for Sequence Probabilities