Optimal reduction of rule length in linear context-free rewriting systems

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

Volumn , Issue , 2009, Pages 539-547

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

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UPPSALA UNIVERSITY   (Sweden)

^c UNIVERSITY OF PADOVA   (Italy)

^d UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED LANGUAGE TRANSLATION; CONTEXT FREE GRAMMARS; SYNTACTICS;

CONTEXT-FREE; GRAMMAR FORMALISMS; MACHINE TRANSLATIONS; OPTIMAL REDUCTIONS; REWRITING SYSTEMS; RIGHT-HAND SIDES; SYNCHRONOUS CONTEXT-FREE GRAMMARS; SYNTACTIC ANALYSIS;

CONTEXT FREE LANGUAGES;

EID: 84858414868     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1620754.1620833     Document Type: Conference Paper

References (17)

1. David Chiang. 2007. Hierarchical phrase-based translation. Computational Linguistics, 33(2):201-228.
2. Daniel Gildea and Daniel Stefankovic. 2007. Worst-case synchronous grammar rules. In Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference, pages 147-154. Association for Computational Linguistics, Rochester, New York.
3. Carlos Gómez-Rodríguez, David J. Weir, and John Carroll. 2009. Parsing mildly non-projective dependency structures. In Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL). To appear.
4. A. K. Joshi and Y. Schabes. 1992. Tree adjoining grammars and lexicalized grammars. In M. Nivat and A. Podelsky, editors, Tree Automata and Languages. Elsevier, Amsterdam, The Netherlands.
5. 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.
6. Marco Kuhlmann and Giorgio Satta. 2009. Tree-bank grammar techniques for non-projective dependency parsing. In Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL). To appear.
7. I. Dan Melamed, Benjamin Wellington, and Giorgio Satta. 2004. Generalized multitext grammars. In 42nd Annual Meeting of the Association for Computational Linguistics (ACL), pages 661-668. Barcelona, Spain.
8. Rebecca Nesson, Giorgio Satta, and Stuart M. Shieber. 2008. Optimal k-arization of synchronous tree-adjoining grammar. In Proceedings of ACL-08: HLT, pages 604-612. Association for Computational Linguistics, Columbus, Ohio.
9. A. Nijholt. 1980. Context-Free Grammars: Cov- ers, Normal Forms, and Parsing, volume 93. Springer-Verlag, Berlin, Germany.
10. Owen Rambow and Giorgio Satta. 1999. Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science, 223(1-2):87-120. (Pubitemid 129609095)
11. Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On Multiple Context-Free Grammars. Theoretical Computer Science, 88(2):191-229. (Pubitemid 21719100)
12. Stuart M. Shieber, Yves Schabes, and Fernando Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3-36.
13. Takeaki Uno and Mutsunori Yagiura. 2000. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290-309.
14. 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.
15. Benjamin Wellington, Sonjia Waxmonsky, and I. Dan Melamed. 2006. Empirical lower bounds on the complexity of translational equivalence. In 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics (COLING-ACL), pages 977-984. Sydney, Australia.
16. Hao Zhang, Daniel Gildea, and David Chiang. 2008. Extracting synchronous grammar rules from word-level alignments in linear time. In 22nd International Conference on Computational Linguistics (Coling), pages 1081-1088. Manchester, England, UK.
17. Hao Zhang, Liang Huang, Daniel Gildea, and Kevin Knight. 2006. Synchronous binarization for machine translation. In Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, pages 256-263. New York, USA.