Optimal head-driven parsing complexity for Linear Context-Free Rewriting Systems

ACL-HLT 2011 - Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies

Volumn 1, Issue , 2011, Pages 450-459

  Crescenzi, Pierluigi ^a   Gildea, Daniel ^b   Marino, Andrea ^a   Rossi, Gianluca ^c   Satta, Giorgio ^d  

^a UNIVERSITY OF FLORENCE   (Italy)

^b University of Rochester   (United States)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

^d UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; NP-HARD; REWRITING SYSTEMS; SPACE COMPLEXITY;

COMPUTATIONAL LINGUISTICS;

CONTEXT FREE LANGUAGES;

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

References (25)

1. Ashok K. Chandra and Philip M. Merlin. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proc. ninth annual ACM symposium on Theory of computing, STOC '77, pages 77-90.
2. Michael Collins. 1997. Three generative, lexicalised models for statistical parsing. In Proc. 35th Annual Conference of the Association for Computational Linguistics (ACL-97), pages 16-23.
3. F. Gavril. 1977. Some NP-complete problems on graphs. In Proc. 11th Conf. on Information Sciences and Systems, pages 91-95.
4. Daniel Gildea and Daniel Štefankovič. 2007. Worst-case synchronous grammar rules. In Proc. 2007 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-07), pages 147- 154, Rochester, NY.
5. Daniel Gildea, Giorgio Satta, and Hao Zhang. 2006. Factoring synchronous grammars by sorting. In Proc. International Conference on Computational Linguistics/Association for Computational Linguistics (COLING/ACL-06) Poster Session, pages 279-286.
6. Daniel Gildea. 2010. Optimal parsing strategies for Linear Context-Free Rewriting Systems. In Proc. 2010 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-10), pages 769-776.
7. Daniel Gildea. 2011. Grammar factorization by tree decomposition. Computational Linguistics, 37(1):231-248.
8. Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, and David Weir. 2009. Optimal reduction of rule length in Linear Context-Free Rewriting Systems. In Proc. 2009 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-09), pages 539-547.
9. Carlos Gómez-Rodríguez, Marco Kuhlmann, and Giorgio Satta. 2010. Efficient parsing of well-nested linear context-free rewriting systems. In Proc. 2010 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-10), pages 276-284, Los Angeles, California.
10. John E. Hopcroft and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
11. Liang Huang, Hao Zhang, Daniel Gildea, and Kevin Knight. 2009. Binarization of synchronous context-free grammars. Computational Linguistics, 35(4):559-595.
12. Laura Kallmeyer and Wolfgang Maier. 2010. Datadriven parsing with probabilistic linear context-free rewriting systems. In Proc. 23rd International Conference on Computational Linguistics (Coling 2010), pages 537-545.
13. Marco Kuhlmann and Giorgio Satta. 2009. Treebank grammar techniques for non-projective dependency parsing. In Proc. 12th Conference of the European Chapter of the ACL (EACL-09), pages 478-486.
14. Thomas Lengauer. 1981. Black-white pebbles and graph separation. Acta Informatica, 16:465-475.
15. Wolfgang Maier and Anders Søgaard. 2008. Treebanks and mild context-sensitivity. In Philippe de Groote, editor, Proc. 13th Conference on Formal Grammar (FG-2008), pages 61-76, Hamburg, Germany. CSLI Publications.
16. F. S. Makedon, C. H. Papadimitriou, and I. H. Sudborough. 1985. Topological bandwidth. SIAM J. Alg. Disc. Meth., 6(3):418-444.
17. B. Monien and I.H. Sudborough. 1988. Min cut is NPcomplete for edge weighted trees. Theor. Comput. Sci., 58:209-229.
18. Rebecca Nesson, Giorgio Satta, and Stuart M. Shieber. 2008. Optimal k-arization of synchronous tree adjoining grammar. In Proc. 46th Annual Meeting of the Association for Computational Linguistics (ACL-08), pages 604-612.
19. Owen Rambow and Giorgio Satta. 1999. Independent parallelism in finite copying parallel rewriting systems. Theor. Comput. Sci., 223(1-2):87-120. (Pubitemid 129609095)
20. Benoît Sagot and Giorgio Satta. 2010. Optimal rank reduction for linear context-free rewriting systems with fan-out two. In Proc. 48th AnnualMeeting of the Association for Computational Linguistics, pages 525-533, Uppsala, Sweden.
21. Giorgio Satta and Enoch Peserico. 2005. Some computational complexity results for synchronous contextfree grammars. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP), pages 803-810, Vancouver, Canada.
22. H. Seki, T. Matsumura, M. Fujii, and T. Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88:191-229. (Pubitemid 21719100)
23. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. The Journal of Logic Programming, 24(1-2):3-36.
24. K. Vijay-Shankar, D. L. Weir, and A. K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. In Proc. 25th Annual Conference of the Association for Computational Linguistics (ACL-87), pages 104-111.
25. Hao Zhang, Liang Huang, Daniel Gildea, and Kevin Knight. 2006. Synchronous binarization for machine translation. In Proc. 2006 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-06), pages 256-263.