Optimizing local probability models for statistical parsing

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2837, Issue , 2003, Pages 409-420

  Toutanova, Kristina ^a   Mitchell, Mark ^b   Manning, Christopher D ^a  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; GRAPH THEORY; INTERPOLATION; LARGE SCALE SYSTEMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; SET THEORY; TREES (MATHEMATICS); ARTIFICIAL INTELLIGENCE; DECISION TREES; REGRESSION ANALYSIS;

CONDITIONAL LIKELIHOOD; DECISION TREE LEARNER; MEMORY-BASED LEARNING; GENERAL CLASS; IMPROVE PERFORMANCE; LOGLINEAR MODEL; PROBABILISTIC SYSTEMS; PROBABILITY MODELS; STATISTICAL PARSING;

NATURAL LANGUAGE PROCESSING SYSTEMS; PROBABILITY DISTRIBUTIONS;

EID: 9444238580     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39857-8_37     Document Type: Conference Paper

References (18)

1. D. M. Bikel, S. Miller, R. Schwartz, and R. Weischedel. Nymble: a high-performance learning name-finder. In Proceedings of the Fifth Conference on Applied Natural Language Processing, pages 194-201, 1997.
2. E. Black, F. Jelinek, J. Lafferty, D. M. Magerman, R. Mercer, and S. Roukos. Towards history-based grammars: Using richer models for probabilistic parsing. In Proceedings of the 31st Meeting of the Association for Computational Linguistics, pages 31-37, 1993.
3. E. Charniak. A maximum entropy inspired parser. In NAACL, 2000.
4. S. F. Chen and J. Goodman. An empirical study of smoothing techniques for language modeling. In Proceedings of the Thirty-Fourth Annual Meeting of the Association for Computational Linguistics, pages 310-318, 1996.
5. M. Collins. Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th Meeting of the Association for Computational Linguistics and the 7th Conference of the European Chapter of the ACL, pages 16-23, 1997.
6. W. Daelemans. Introduction to the special issue on memory-based language processing. Journal of Experimental and Theoretical Artificial Intelligence, 11:3:287-292, 1999.
7. W. Daelemans, A. van den Bosch, and J. Zavrel. Forgetting exceptions is harmful in language learning. Machine Learning, 34:1/3:11-43, 1999.
8. I. Dagan, L. Lee, and F. Pereira. Similarity-based models of cooccurrence probabilities. Machine Learning, 34(1-3):43-69, 1999.
9. J. Friedman. On bias variance 0/1-loss and the curse-of-dimensionality. Journal of Data Mining and Knowledge Discovery, 1(1), 1996.
10. J. T. Goodman. A bit of progress in language modeling: Extended version. In MSR Technical Report MSR-TR-2001-72, 2001.
11. D. Klein and C. D. Manning. Accurate unlexicalized parsing. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 2003.
12. L. Lee. Measures of distributional similarity. In 37th Annual Meeting of the Association for Computational Linguistics, pages 25-32, 1999.
13. D. M. Magerman. Statistical decision-tree models for parsing. In Proceedings of the 33rd Meeting of the Association for Computational Linguistics, 1995.
14. S. Oepen, K. Toutanova, S. Shieber, C. Manning, D. Flickinger, and T. Brants. The LinGo Redwoods treebank: Motivation and preliminary applications. In COLING 19, 2002.
15. C. Pollard and I. A. Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press, 1994.
16. A. Ratnaparkhi. A linear observed time statistical parser based on maximum entropy models. In EMNLP, pages 1-10, 1997.
17. I. H. Witten and T. C. Bell. The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Trans. Inform. Theory, 37, 4:1085-1094, 1991.
18. J. Zavrel and W. Daelemans. Memory-based learning: Using similarity for smoothing. In Joint ACL/EACL, 1997.