Multilevel coarse-to-fine PCFG parsing

HLT-NAACL 2006 - Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings of the Main Conference

Volumn , Issue , 2006, Pages 168-175

  Charniak, Eugene ^a   Johnson, Mark ^a   Elsner, Micha ^a   Austerweil, Joseph ^a   Ellis, David ^a   Haxton, Isaac ^a   Hill, Catherine ^a   Shrivaths, R ^a   Moore, Jeremy ^a   Pozar, Michael ^a   Vu, Theresa ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; EQUIVALENCE CLASSES;

COARSE TO FINE; NESTED PARTITIONS; PARSING ALGORITHM; SEARCH SPACES; WORK LOADS;

FORMAL LANGUAGES;

EID: 84863399844     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220835.1220857     Document Type: Conference Paper

References (18)

1. Sharon Caraballo and Eugene Charniak. 1998. Figures of merit for best-first probabalistic parsing. Computational Linguistics, 24(2):275-298. (Pubitemid 128455531)
2. Eugene Charniak and Mark Johnson. 2005. Coarse-to-fine n-best parsing and maxent discriminative reranking. In Proceedings of the 2005 Meeting of the Association for Computational Linguistics.
3. Eugene Charniak, Sharon Goldwater, and Mark Johnson. 1998. Edge-based best-first chart parsing. In Proceedings of the Sixth Workshop on Very Large Corpora, pages 127-133. Morgan Kaufmann.
4. Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of the North American Chapter of the Association for Computational Linguistics, pages 132-139.
5. Michael Collins. 1997. Three generative, lexicalized models for statistical parsing. In Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics, San Francisco. Morgan Kaufmann.
6. Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and head automaton grammars. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pages 457-464.
7. Stuart Geman and Kevin Kochanek. 2001. Dynamic programming and the representation of soft-decodable codes. IEEE Transactions on Information Theory, 47:549-568. (Pubitemid 32318089)
8. Joshua Goodman. 1997. Global thresholding and multiple-pass parsing. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP 1997).
9. Keith Hall and Mark Johnson. 2004. Attention shifting for parsing speech. In The Proceedings of the 42th Annual Meeting of the Association for Computational Linguistics, pages 40-46.
10. Keith Hall. 2004. Best-first Word-lattice Parsing: Techniques for Integrated Syntactic Language Modeling. Ph.D. thesis, Brown University.
11. Mark Johnson and Eugene Charniak. 2004. A TAG-based noisy-channel model of speech repairs. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, pages 33-39.
12. Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24(4):613-632. (Pubitemid 128455527)
13. * parsing: Fast exact viterbi parse selection. In Proceedings of HLT-NAACL'03.
14. Dan Klein and Christopher Manning. 2003b. Accurate unlexicalized parsing. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics.
15. Michell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
16. John T. Maxwell and Ronald M. Kaplan. 1993. The interface between phrasal and functional constraints. Computational Linguistics, 19(4):571-590.
17. Ryan McDonald, Toby Crammer, and Fernando Pereira. 2005. Online large margin training of dependency parsers. In Proceedings of the 43rd Meeting of the Association for Computational Linguistics.
18. Yoshimasa Tsuruoka and Jun'ichi Tsujii. 2004. Iterative cky parsing for probabilistic context-free grammars. In International Joint Conference on Natural-Language Processing.