TAG, dynamic programming, and the perceptron for efficient, feature-rich parsing

CoNLL 2008 - Proceedings of the Twelfth Conference on Computational Natural Language Learning

Volumn , Issue , 2008, Pages 9-16

  Carreras, Xavier ^a   Collins, Michael ^a   Koo, Terry ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; FORESTRY; FORMAL LANGUAGES; SYNTACTICS; TREES (MATHEMATICS);

DEPENDENCY PARSING; DYNAMIC PROGRAMMING METHODS; PARSING ALGORITHM; PERCEPTRON ALGORITHMS; STATE-OF-THE-ART PERFORMANCE; SURFACE FEATURE; SYNTACTIC PARSING; TREE ADJOINING GRAMMARS;

DYNAMIC PROGRAMMING;

EID: 80053251519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1596324.1596327     Document Type: Conference Paper

References (26)

1. Altun, Y., I. Tsochantaridis, and T. Hofmann. 2003. Hidden markov support vector machines. In ICML.
2. Carreras, X. 2007. Experiments with a higher-order projective dependency parser. In Proc. EMNLP-CoNLL Shared Task.
3. Charniak, E. and M. Johnson. 2005. Coarse-to-fine n-best parsing and maxent discriminative reranking. In Proc. ACL.
4. Charniak, E. 2000. A maximum-entropy-inspired parser. In Proc. NAACL.
5. Chiang, D. 2003. Statistical parsing with an automatically extracted tree adjoining grammar. In Bod, R., R. Scha, and K. Sima'an, editors, Data Oriented Parsing, pages 299-316. CSLI Publications.
6. Clark, S. and J. R. Curran. 2004. Parsing the wsj using ccg and log-linear models. In Proc. ACL.
7. Clark, Stephen and James R. Curran. 2007. Perceptron training for a wide-coverage lexicalized-grammar parser. In Proc. ACL Workshop on Deep Linguistic Processing.
8. Collins, M. 1997. Three generative, lexicalised models for statistical parsing. In Proc. ACL.
9. Collins, M. 2000. Discriminative reranking for natural language parsing. In Proc. ICML.
10. Collins, M. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP.
11. Eisner, J. 2000. Bilexical grammars and their cubic-time parsing algorithms. In Bunt, H. C. and A. Nijholt, editors, New Developments in Natural Language Parsing, pages 29-62. Kluwer Academic Publishers.
12. Finkel, J. R., A. Kleeman, and C. D. Manning. 2008. Efficient, feature-based, conditional random field parsing. In Proc. ACL/HLT.
13. Globerson, A., T. Koo, X. Carreras, and M. Collins. 2007. Exponentiated gradient algorithms for log-linear structured prediction. In Proc. ICML.
14. Huang, L. 2008. Forest reranking: Discriminative parsing with non-local features. In Proc. ACL/HLT.
15. Johnson, M., S. Geman, S. Canon, Z. Chi, and S. Riezler. 1999. Estimators for stochastic unification-based grammars. In Proc. ACL.
16. Koo, Terry, Xavier Carreras, and Michael Collins. 2008. Simple semi-supervised dependency parsing. In Proc. ACL/HLT.
17. Lafferty, J., A. McCallum, and F. Pereira. 2001. Conditonal random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML.
18. McDonald, R. and F. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. EACL.
19. McDonald, R., K. Crammer, and F. Pereira. 2005. Online large-margin training of dependency parsers. In Proc. ACL.
20. Petrov, S. and D. Klein. 2007. Improved inference for unlexicalized parsing. In Proc. of HLT-NAACL.
21. Petrov, S., A. Pauls, and D. Klein. 2007. Discriminative loglinear grammars with latent variables. In Proc. NIPS.
22. Ratnaparkhi, A., S. Roukos, and R. Ward. 1994. A maximum entropy model for parsing. In Proc. ICSLP.
23. Sagae, Kenji, Yusuke Miyao, and Jun'ichi Tsujii. 2007. Hpsg parsing with shallow dependency constraints. In Proc. ACL, pages 624-631.
24. Shen, L. and A.K. Joshi. 2005. Incremental ltag parsing. In Proc HLT-EMNLP.
25. Taskar, B., D. Klein, M. Collins, D. Koller, and C. Manning. 2004. Max-margin parsing. In Proceedings of the EMNLP-2004.
26. Yamada, H. and Y. Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proc. IWPT.