Proceedings

Correspondence-guided Synchronous Parsing of Parallel Corpora

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1694-1694.

© 2005 International Joint Conferences on Artificial Intelligence

Abstract

We present an efficient dynamic programming algorithm for synchronous parsing of sentence pairs from a parallel corpus with a given word alignment. Unless there is a large proportion of words without a correspondence in the other language, the worstcase complexity is significantly reduced over standard synchronous parsing. The theoretical complexity results are corroborated by a quantitative experimental evaluation.

  1. [Lewis II and Stearns, 1968] P. M. Lewis II and R. E. Stearns. Syntax-directed transduction. Journal of the Association of Com- puting Machinery, 15(3):465-488, 1968.
  2. [Melamed, 2003] I. Dan Melamed. Multitext grammars and syn- chronous parsers. In Proceedings of NAACL/HLT, 2003.
  3. [Wu, 1997] Dekai Wu. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguis- tics, 23(3):377-403, 1997.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards