Bazaraa MS, Sherali HD, Shetty CM. (1993). Nonlinear programming theory and algorithms (2nd ed).
Berger AL, Della_Pietra SA, Della_Pietra VJ. (1996). A maximum entropy approach to natural language processing Computational Linguistics. 22
Bialek W, Nemenman I, Shafee F. (2002). Entropy and inference, revisited Advances in neural information processsing systems.
Chen SF, Goodman J. (1996). An empirical study of smoothing techniques for language modeling Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics.
Chen SF, Rosenfeld R. (1999). A gaussian prior for smoothing maximum entropy models Tech Rep.
Cover TM, Thomas JA. (1991). Elements of Information Theory.
Csiszar I. (1975). I-divergence geometry of probability distributions and minimization problems Annals Of Probability. 3
Fletcher R. (1981). Practical methods of optimization. 2
Good IJ. (1953). The population frequencies of species and the estimation of population parameters Biometrika. 40
Ha LQ, Sicilia E, Ming J, Smith FJ. (2002). Extension of Zipfs law to words and phrases International Conference on Computational Linguistics (COLING2002).
Hogg RV, Craig AT. (1995). Introduction to Mathematical Statistics (5th ed.).
Jaynes ET. (1994). Probability theory: The logic of science.
Jelinek F. (1998). Statistical methods for speech recognition.
Kazama J, Tsujii J. (2003). Evaluation and extension of maximum entropy models with inequality constraints Proceedings of the 2003 Conference on Empirical Methods in Natural Language Processing.
Khudanpur S. (1995). A method of ME estimation with relaxed constraints Proceedings of the Johns Hopkins University Language Modeling Workshop.
Lawrence CT, Zhou JL, Tits AL. (1997). Users guide for CFSQP version 2.5: A C code for solving (large scale) constrained nonlinear (minimax) optimization problems, generating iterates satisfying all inequality constraints Tech. Rep. No. TR-94-16r1.
Li W. (1999). References on Zipfs law (Available online: http:--linkage.rockefeller.edu-wli-zipf-).
Lidstone G. (1920). Note on the general case of the Bayes-Laplace formula for inductive or posterior probabilities Trans Fac Actuaries. 8
Olkin I, Sobel M. (1979). Admissible and minimax estimation for the multinomial distribution and k independent binomial distributions Ann Math Stat. 7
Orlitsky A, Santhanam NP, Zhang J. (2003). Always Good Turing: asymptotically optimal probability estimation. Science (New York, N.Y.). 302 [PubMed]
Pöschel T, Ebeling W, Frömmel C, Ramírez R. (2003). Correction algorithm for finite sample statistics. The European physical journal. E, Soft matter. 12 [PubMed]
Ristad ES. (1995). A natural law of succession Tech. Rep. No. CS-TR-495-95.
Schapire RE, Mcallester D. (2000). On the convergence rate of Good-Turing estimators Proc. 13th Annual Conference on Computational Learning Theory.
Steinhaus H. (1957). The problem of estimation Ann Math Stat. 28