[1]
|
P. F. Brown, V. J. Pietra, P. V. deSouza, J. C. Lai and R. L. Mercer, “Class-Based n-Gram Models of Natural Language,” Computational Linguistics, Vol. 18, 1992, pp. 467-479.
|
[2]
|
F. Jelinek, “Automatic Speech Recognition-Statistical Methods, M.I.T., 1997.
|
[3]
|
W. Naptali, “Masatoshi Tsuchiya, and Seiichi Nakagawa,” ACM Transactions on Asian Language Information Processing, Vol. 9, No. 2, Article 7, Pub., 2010.
|
[4]
|
L. H. Witten and T. C. Bell, “The Zero-Frequency Problem: Estimating the Probabilities of Novel Events in Adaptive Text Compression,” IEEE Transactions on Information Theory, Vol. 37, No. 4, 1991, pp. 1085-1094.
http://dx.doi.org/10.1109/18.87000
|
[5]
|
D. Jurafsky and J. H. Martin, “Speech and Language Processing,” Prentice Hall, Chapter 6, 2000.
|
[6]
|
W. A. Gale and G. Sampson, “Good-Turing Frequency Estimation without Tears,” Journal of Quantitative Linguistics, Vol. 2, No. 3, 1995, pp. 15-19.
http://dx.doi.org/10.1080/09296179508590051
|
[7]
|
I. J. Good, “The Population Frequencies of Species and the Estimation of Population Parameters,” Biometrika, Vol. 40, 1953, pp. 237-264.
|
[8]
|
S. M. Katz, “Estimation of Probabilities from Sparse Data for the Language Models Component of a Speech Recognizer,” IEEE Transactions on Acoustic, Speech and Signal Processing, Vol. ASSP-35, 1987, pp. 400-401.
http://dx.doi.org/10.1109/TASSP.1987.1165125
|
[9]
|
S. F. Chen and G. Joshua, “An Empirical Study of Smoothing Techniques for Language Modeling,” Computer Speech and Language, Vol. 13, 1999, pp. 359-394.
http://dx.doi.org/10.1006/csla.1999.0128
|
[10]
|
K. W. Church and W. A. Gale, “A Comparison of the Enhanced Good-Turing and Deleted Estimation Methods for Estimating Probabilies of English Bigrams,” Computer Speech and Language, Vol. 5, 1991, pp. 19-54.
http://dx.doi.org/10.1016/0885-2308(91)90016-J
|
[11]
|
S. F. Chen and G. Joshua, “An Empirical Study of Smoothing Techniques for Language Modeling,” Computer Speech and Language, Vol. 13, 1999, pp. 359-394.
http://dx.doi.org/10.1006/csla.1999.0128
|
[12]
|
P. H. Algort and T. M. Cover, “A Sandwich Proof of the Shannon-McMillan-Breiman Theorem,” The Annals of Probability, Vol. 16, No. 2, 1988, pp. 899-909.
http://dx.doi.org/10.1214/aop/1176991794
|
[13]
|
S. Ostrogonac, B. Popovi?, M. Se?ujski, R. Mak and D. Pekar, “Language Model Reduction for Practical Implementation in LVCSR Systems,” INFOTEH-JAHORINA, Vol. 12, 2013, pp. 391-394.
|
[14]
|
P. F. Brown, S. A. Della Pietra, V. J. Della Pietra, J. C. Lai and R. L. Mercer, “An Estimate of an Upper Bound for the Entropy of English,” Computational Linguistics, Vol. 18, 1992, pp. 31-40.
|