Speeding up full syntactic parsing by leveraging partial parsing decisions

COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Main Conference Poster Sessions

Volumn , Issue , 2006, Pages 295-300

  Glaysher, Elliot ^a   Moldovan, Dan ^a  

^a Language Computer Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS;

COMBINATORIAL EXPLOSION; PARSE TREES; PARSING ALGORITHM; PARTIAL PARSING; PRECISION AND RECALL; SYNTACTIC PARSING; THREE FOLDS;

SYNTACTICS;

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

References (12)

1. Xavier Carreras and Lluís Márquez. 2001. Boosting trees for anti-spam email filtering. In Proceedings of RANLP-01, 4th International Conference on Recent Advances in Natural Language Processing, Tzigov Chark, BG.
2. Xavier Carreras, Lluís Màrquez, Vasin Punyakanok, and Dan Roth. 2002. Learning and inference for clause identification. In ECML'02: Proceedings of the 13th European Conference on Machine Learning, pages 35-47, London, UK. Springer-Verlag.
3. Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of the first conference on North American chapter of the Association for Computational Linguistics, pages 132-139, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
4. Michael John Collins. 1996. A new statistical parser based on bigram lexical dependencies. In Arivind Joshi and Martha Palmer, editors, Proceedings of the Thirty-Fourth Annual Meeting of the Association for Computational Linguistics, pages 184-191, San Francisco. Morgan Kaufmann Publishers.
5. Michael John Collins. 1999. Head-driven statistical models for natural language parsing. Ph.D. thesis, University of Pennsylvania. Supervisor-Mitchell P. Marcus.
6. Taku Kudo and Yuji Matsumoto. 2001. Chunking with support vector machines. In NAACL'01: Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001, pages 1-8, Morristown, NJ, USA. Association for Computational Linguistics.
7. Taku Kudo and Yuji Matsumoto. 2003. Fast methods for kernel-based text analysis. In ACL'03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics, pages 24-31, Morristown, NJ, USA. Association for Computational Linguistics.
8. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1994. Building a large annotated corpus of english: The penn treebank. Computational Linguistics, 19(2):313-330.
9. Landon C. Noll. 2005. Fnv hash. http://www.isthe.com/chongo/tech/comp/fnv/.
10. Anoop Sarkar. 2000. Practical experiments in parsing using tree adjoining grammars. In Proceedings of the Fifth International Workshop on Tree Adjoining Grammars, Paris, France.
11. Erik F. Tjong Kim Sang and Sabine Buchholz. 2000. Introduction to the conll-2000 shared task: Chunking. In Claire Cardie, Walter Daelemans, Claire Nedellec, and Erik Tjong Kim Sang, editors, Proceedings of CoNLL-2000 and LLL-2000, pages 127-132. Lisbon, Portugal.
12. Erik F. Tjong Kim Sang and Hervé Déjean. 2001. Introduction to the conll-2001 shared task: Clause identification. In Walter Daelemans and Rémi Zajac, editors, Proceedings of CoNLL-2001, pages 53-57. Toulouse, France.