• Corpus ID: 16496781

- 1-Good-Turing Smoothing Without

@inproceedings{Gale19941S,
  title={- 1-Good-Turing Smoothing Without},
  author={William A. Gale},
  year={1994}
}
  • W. Gale
  • Published 1994
  • Computer Science
The performance of statistically based techniques for many tasks such as spelling correction, sense disambiguation, and translation is improved if one can estimate a probability for an object of interest which has not been seen before. Good-Turing methods are one means of estimating these probabilities for previously unseen objects. However, the use of Good-Turing methods requires a smoothing step which must smooth in regions of vastly different accuracy. Such smoothers are difficult to use… 
A Large-Scale Study of File Prevalence
TLDR
A large-scale telemetry project that gathered file reports from 20.7 million machines that ran the Windows Upgrade Advisor over a period of 13 months gives a unique insight into file prevalence across a web-scale population.

References

SHOWING 1-8 OF 8 REFERENCES
On Turing's formula for word probabilities
  • A. Nádas
  • Mathematics
    IEEE Trans. Acoust. Speech Signal Process.
  • 1985
TLDR
It is remarkable that Turing's formula can be obtained by significantly different statistical methods; it is compared three ways to obtain it.
Bayesian inference in statistical analysis
TLDR
This chapter discusses Bayesian Assessment of Assumptions, which investigates the effect of non-Normality on Inferences about a Population Mean with Generalizations in the context of a Bayesian inference model.
The New S Language
Probability distribution estimation from sparse data
  • IBM Technical Disclosure Bulletin
  • 1985
Bayesian Inference in Statistical Analysis, Addison-Wesley
  • 1973
Appendix I of (Church and Gale
  • Appendix I of (Church and Gale
  • 1991