Efficient parsing of well-nested 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 276-284

  Gómez Rodríguez, Carlos ^a   Kuhlmann, Marco ^b   Satta, Giorgio ^c  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UPPSALA UNIVERSITY   (Sweden)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; FREE WORD ORDER; LINEAR SPACES; NORMAL FORM; PARSING ALGORITHM; REWRITING SYSTEMS; RUNNING TIME; UPPER BOUND;

COMPUTATIONAL LINGUISTICS;

CONTEXT FREE LANGUAGES;

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

References (23)

1. Éric Villemonte de la Clergerie. 2002. Parsing mildly context-sensitive languages with thread automata. In 19th International Conference on Computational Linguistics (COLING), pages 1-7, Taipei, Taiwan.
2. Daniel Gildea. 2010. Optimal parsing strategies for linear context-free rewriting systems. In Human Language Technologies: The Eleventh Annual Conference of the North American Chapter of the Association for Computational Linguistics, Los Angeles, USA.
3. Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, and David J. Weir. 2009. Optimal reduction of rule length in linear context-free rewriting systems. In Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, pages 539-547, Boulder, CO, USA.
4. Jiří Havelka. 2007. Beyond projectivity: Multilingual evaluation of constraints and measures on non-projective structures. In 45th Annual Meeting of the Association for Computational Linguistics (ACL), pages 608-615.
5. Günter Hotz and Gisela Pitsch. 1996. On parsing coupled-context-free languages. Theoretical Computer Science, 161(1-2):205-233. (Pubitemid 126412757)
6. Riny Huybregts. 1984. The weak inadequacy of context-free phrase structure grammars. In Ger de Haan, Mieke Trommelen, and Wim Zonneveld, editors, Van periferie naar kern, pages 81-99. Foris, Dordrecht, The Netherlands.
7. Aravind K. Joshi, Leon S. Levy, and Masako Takahashi. 1975. Tree Adjunct Grammars. Journal of Computer and System Sciences, 10(2):136-163.
8. Aravind K. Joshi. 1985. Tree Adjoining Grammars: How much context-sensitivity is required to provide reasonable structural descriptions? In Natural Language Parsing, pages 206-250. Cambridge University Press.
9. Laura Kallmeyer and Wolfgang Maier. 2009. An incremental Earley parser for simple range concatenation grammar. In Proceedings of the 11th International Conference on Parsing Technologies (IWPT 2009), pages 61-64. Association for Computational Linguistics.
10. Makoto Kanazawa and Sylvain Salvati. 2010. The copying power of well-nested multiple context-free grammars. In Fourth International Conference on Language and Automata Theory and Applications, Trier, Germany.
11. Makoto Kanazawa. 2009. The pumping lemma for well-nested multiple context-free languages. In Developments in Language Theory. 13th International Conference, DLT 2009, Stuttgart, Germany, June 30-July 3, 2009. Proceedings, volume 5583 of Lecture Notes in Computer Science, pages 312-325.
12. Marco Kuhlmann and Mathias Möhl. 2007. Mildly context-sensitive dependency languages. In 45th Annual Meeting of the Association for Computational Linguistics (ACL), pages 160-167.
13. Marco Kuhlmann and Joakim Nivre. 2006. Mildly non-projective dependency structures. In 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics (COLING-ACL), Main Conference Poster Sessions, pages 507-514, Sydney, Australia.
14. Marco Kuhlmann and Giorgio Satta. 2009. Treebank grammar techniques for non-projective dependency parsing. In Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL), pages 478-486, Athens, Greece.
15. Wolfgang Maier and Timm Lichte. 2009. Characterizing discontinuity in constituent treebanks. In 14th Conference on Formal Grammar, Bordeaux, France.
16. Wolfgang Maier and Anders Søgaard. 2008. Treebanks and mild context-sensitivity. In 13th Conference on Formal Grammar, pages 61-76, Hamburg, Germany.
17. Owen Rambow and Giorgio Satta. 1999. Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science, 223(1-2):87-120. (Pubitemid 129609095)
18. Giorgio Satta. 1992. Recognition of Linear Context-Free Rewriting Systems. In 30th Annual Meeting of the Association for Computational Linguistics (ACL), pages 89-95, Newark, DE, USA.
19. Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On Multiple Context-Free Grammars. Theoretical Computer Science, 88(2):191-229. (Pubitemid 21719100)
20. Stuart M. Shieber, Yves Schabes, and Fernando Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3-36.
21. Stuart M. Shieber. 1985. Evidence against the context-freeness of natural language. Linguistics and Philosophy, 8(3):333-343.
22. Klaas Sikkel. 1997. Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms. Springer.
23. K. Vijay-Shanker, David J. Weir, and Aravind K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. In 25th Annual Meeting of the Association for Computational Linguistics (ACL), pages 104-111, Stanford, CA, USA.