Extracting synchronous grammar rules from word-level alignments in linear time

Coling 2008 - 22nd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2008, Pages 1081-1088

  Zhang, Hao ^a   Gildea, Daniel ^a   Chiang, David ^b  

^a University of Rochester   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS;

ALIGNED SENTENCES; COMMON INTERVALS; LANGUAGE PAIRS; LINEAR TIME; MANY TO MANY; SYNCHRONOUS CONTEXT-FREE GRAMMARS; SYNCHRONOUS GRAMMARS; WORD LEVEL;

CONTEXT FREE GRAMMARS;

EID: 80053408161     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1599081.1599217     Document Type: Conference Paper

References (11)

1. Brown, Peter F., Stephen A. Delia Pietra, Vincent J. Delia Pietra, and Robert L. Mercer. 1993. The mathematics of Statistical machine translation: Parameter estimation. Computational Linguistics, 19(2):263-311.
2. Bui-Xuan, Binh Minh, Michel Habib, and Christophe Paul. 2005. Revisiting T. Uno and M. Yagiura's algorithm. In The 16th Annual International Symposium on Algorithms and Computation (ISAAC '05), pages 146-155.
3. Chiang, David. 2005. A hierarchical phrase-based model for statistical machine translation. In Proceedings of ACL 2005, pages 263-270.
4. Galley, Michel, Mark Hopkins, Kevin Knight, and Daniel Marcu. 2004. What's in a translation rule? In Proceedings of NAACL 2004.
5. Landau, Gad M., Laxmi Parida, and Oren Weimann. 2005. Gene proximity analysis across whole genomes via PQ trees. Journal of Computational Biology, 12(10): 1289-1306.
6. Och, Franz Josef and Hermann Ney. 2004a. The alignment template approach to statistical machine translation. Computational Linguistics, 30(4).
7. Och, Franz Josef and Hermann Ney. 2004b. The alignment template approach to statistical machine translation. Computational Linguistics, 30:417-449.
8. Satta, Giorgio and Enoch Peserico. 2005. Some computational complexity results for synchronous context-free grammars. In Proceedings of EMNLP 2005, pages 803-810, Vancouver, Canada, October.
9. Uno, Takeaki and Mutsunori Yagiura. 2000. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290-309.
10. Wellington, Benjamin, Sonjia Waxmonsky, and I. Dan Melamed. 2006. Empirical lower bounds on the complexity of translational equivalence. In Proceedings of COLING-ACL 2006.
11. Zhang, Hao and Daniel Gildea. 2007. Factorization of synchronous context-free grammars in linear time. In Proceedings of the NAACL Workshop on Syntax and Structure in Statistical Translation (SSST).