Optimal parsing strategies for linear context-free rewriting systems

NAACL HLT 2010 - Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Main Conference

Volumn , Issue , 2010, Pages 769-776

  Gildea, Daniel ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; FACTORIZATION ALGORITHMS; FAN-OUT; REWRITING SYSTEMS; RIGHT-HAND SIDES; TREEBANKS;

COMPUTATIONAL LINGUISTICS; FACTORIZATION; FORESTRY; TREES (MATHEMATICS);

CONTEXT FREE LANGUAGES;

ALGORITHMS; COMPUTATION; LANGUAGES;

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

References (11)

1. Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, and David Weir. 2009a. Optimal reduction of rule length in linear conext-free rewriting systems. In Proceedings of the 2009 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-09), pages 539-547.
2. Carlos Gómez-Rodríguez, David Weir, and John Carroll. 2009b. Parsing mildly non-projective dependency structures. In Proceedings of the 12th Conference of the European Chapter of the ACL (EACL-09), pages 291-299.
3. A.K. Joshi and Y. Schabes. 1997. Tree-adjoining grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 69-124. Springer, Berlin.
4. Marco Kuhlmann and Joakim Nivre. 2006. Mildly non-projective dependency structures. In Proceedings of the International Conference on Computational Linguistics/Association for Computational Linguistics (COLING/ACL-06), pages 507-514.
5. Marco Kuhlmann and Giorgio Satta. 2009. Treebank grammar techniques for non-projective dependency parsing. In Proceedings of the 12th Conference of the European Chapter of the ACL (EACL-09), pages 478-486.
6. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP).
7. I. Dan Melamed, Giorgio Satta, and Ben Wellington. 2004. Generalized multitext grammars. In Proceedings of the 42nd Annual Conference of the Association for Computational Linguistics (ACL-04), Barcelona, Spain.
8. Owen Rambow and Giorgio Satta. 1999. Independent parallelism in finite copying parallel rewriting systems. Theor. Comput. Sci., 223(1-2):87-120. (Pubitemid 129609095)
9. H. Seki, T. Matsumura, M. Fujii, and T. Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88:191-229. (Pubitemid 21719100)
10. K. Vijay-Shankar, D. L. Weir, and A. K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. In Proceedings of the 25th Annual Conference of the Association for Computational Linguistics (ACL-87).
11. Benjamin Wellington, Sonjia Waxmonsky, and I. Dan Melamed. 2006. Empirical lower bounds on the complexity of translational equivalence. In Proceedings of the International Conference on Computational Linguistics/Association for Computational Linguistics (COLING/ACL-06), pages 977-984, Sydney, Australia.