Computationally efficient m-estimation of log-linear structure models

ACL 2007 - Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2007, Pages 752-759

  Smith, Noah A ^a   Vail, Douglas L ^a   Lafferty, John D ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONALLY EFFICIENT; CONDITIONAL RANDOM FIELD; DISCRIMINATIVE TRAINING; LIKELIHOOD ESTIMATION; LOGLINEAR MODEL; LOSS FUNCTIONS; M-ESTIMATION; PSEUDO-LIKELIHOOD; SHALLOW PARSING; STRUCTURE MODELS; TRAINING TIME;

COMPUTATIONAL LINGUISTICS; INFORMATION THEORY; REGRESSION ANALYSIS;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 84860505054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. J. E. Besag. 1975. Statistical analysis of non-lattice data. The Statistician, 24:179-195.
2. T. L. Booth and R. A. Thompson. 1973. Applying probability measures to abstract languages. IEEE Transactions on Computers, 22(5):442-450.
3. S. Chen and R. Rosenfeld. 2000. A survey of smoothing techniques for ME models. IEEE Transactions on Speech and Audio Processing, 8(1):37-50.
4. Z. Chi and S. Geman. 1998. Estimation of probabilistic context-free grammars. Computational Linguistics, 24(2):299-305.
5. A. Corazza and G. Satta. 2006. Cross-entropy and estimation of probabilistic context-free grammars. In Proc. of HLTNAACL.
6. A. Dempster, N. Laird, and D. Rubin. 1977. Maximum likelihood estimation from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39:1-38.
7. J. Eisner, E. Goldlust, and N. A. Smith. 2005. Compiling Comp Ling: Practical weighted dynamic programming and the Dyna language. In Proc. of HLT-EMNLP.
8. Y. Jeon and Y. Lin. 2006. An effective method for highdimensional log-density ANOVA estimation, with application to nonparametric graphical model building. Statistical Sinica, 16:353-374.
9. M. Johnson. 2001. Joint and conditional estimation of tagging and parsing models. In Proc. of ACL.
10. D. Klein and C. D. Manning. 2002. Conditional structure vs. conditional estimation in NLP models. In Proc. of EMNLP.
11. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. of ICML.
12. D. C. Liu and J. Nocedal. 1989. On the limited memory BFGS method for large scale optimization. Math. Programming, 45:503-528.
13. A. McCallum, D. Freitag, and F. Pereira. 2000. Maximum entropy Markov models for information extraction and segmentation. In Proc. of ICML.
14. A. Ng and M. Jordan. 2002. On discriminative vs. generative classifiers: A comparison of logistic regression and naïve Bayes. In NIPS 14.
15. J. A. O'Sullivan. 1998. Alternating minimization algorithms: from Blahut-Armijo to Expectation-Maximization. In A. Vardy, editor, Codes, Curves, and Signals: Common Threads in Communications, pages 173-192. Kluwer.
16. R. Rosenfeld. 1997. A whole sentence maximum entropy language model. In Proc. of ASRU.
17. F. Sha and F. Pereira. 2003. Shallow parsing with conditional random fields. In Proc. of HLT-NAACL.
18. A. Stolcke. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201.
19. C. Sutton and A. McCallum. 2005. Piecewise training of undirected models. In Proc. of UAI.
20. E. F. Tjong Kim Sang and S. Buchholz. 2000. Introduction to the CoNLL-2000 shared task: Chunking. In Proc. of CoNLL.
21. K. Toutanova, D. Klein, C. D. Manning, and Y. Singer. 2003. Feature-rich part-of-speech tagging with a cyclic dependency network. In Proc. of HLT-NAACL.
22. A. W. van der Vaart. 1998. Asymptotic Statistics. Cambridge University Press.