### Abstract

While deciphering the Enigma code, Good and Turing derived an unintuitive, yet effective, formula for estimating a probability distribution from a sample of data. We define the attenuation of a probability estimator as the largest possible ratio between the per-symbol probability assigned to an arbitrarily long sequence by any distribution, and the corresponding probability assigned by the estimator. We show that some common estimators have infinite attenuation and that the attenuation of the Good-Turing estimator is low, yet greater than 1. We then derive an estimator whose attenuation is 1; that is, asymptotically it does not underestimate the probability of any sequence.

Original language | English (US) |
---|---|

Pages (from-to) | 427-431 |

Number of pages | 5 |

Journal | Science |

Volume | 302 |

Issue number | 5644 |

DOIs | |

State | Published - Oct 17 2003 |

### ASJC Scopus subject areas

- General

### Cite this

*Science*,

*302*(5644), 427-431. https://doi.org/10.1126/science.1088284