Classifying chart cells for quadratic complexity context-free inference

Coling 2008 - 22nd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2008, Pages 745-752

  Roark, Brian ^a   Hollingshead, Kristy ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; MULTI-WORD; QUADRATIC COMPLEXITY; WORST-CASE COMPLEXITY;

COMPUTATIONAL LINGUISTICS;

EID: 80053415858     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1599081.1599175     Document Type: Conference Paper

References (12)

1. Charniak, E. and M. Johnson. 2005. Coarse-to-fine n-best parsing and MaxEnt discriminative reranking. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL), pages 173-180.
2. Charniak, E. 2000. A maximum-entropy-inspired parser. In Proceedings of the 1st Conference of the North American Chapter of the Association for Computational Linguistics, pages 132-139.
3. Cocke, J. and J.T. Schwartz. 1970. Programming languages and their compilers: Preliminary notes. Technical report, Courant Institute of Mathematical Sciences, NYU.
4. Collins, M.J. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with per-ceptron algorithms. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 1-8.
5. Earley, J. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 6(8):451-455.
6. Glaysher, E. and D. Moldovan. 2006. Speeding up full syntactic parsing by leveraging partial parsing decisions. In Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 295-300.
7. Hollingshead, K. and B. Roark. 2007. Pipeline iteration. In Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics (ACL), pages 952-959.
8. Kasami, T. 1965. An efficient recognition and syntax analysis algorithm for context-free languages. Technical report, AFCRL-65-758, Air Force Cambridge Research Lab., Bedford, MA.
9. Marcus, M.P, M.A. Marcinkiewicz, and B. Santorini. 1993. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, 19:313-330.
10. Ratnaparkhi, A. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34(1-3):151-175.
11. Sha, E and F. Pereira. 2003. Shallow parsing with conditional random fields. In Proceedings of HLT-NAACL, pages 134-141.
12. 3. Information and Control, 10(2): 189-208.