Terminal-Aware Synchronous Binarization

We present an SCFG binarization algorithm that combines the strengths of early terminal matching on the source language side and early language model integration on the target language side. We also examine how different strategies of target-side terminal attachment during binarization can significantly affect translation quality.

[1]  David Chiang,et al.  Hierarchical Phrase-Based Translation , 2007, CL.

[2]  Jingbo Zhu,et al.  Better Synchronous Binarization for Machine Translation , 2009, EMNLP.

[3]  Dekai Wu,et al.  Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora , 1997, CL.

[4]  Mark Hopkins,et al.  SCFG Decoding Without Binarization , 2010, EMNLP.

[5]  Daniel Gildea,et al.  Synchronous Binarization for Machine Translation , 2006, NAACL.

[6]  Maria Leonor Pacheco,et al.  of the Association for Computational Linguistics: , 2001 .

[7]  Daniel Gildea,et al.  Binarization of Synchronous Context-Free Grammars , 2009, CL.

[8]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[9]  Joshua Goodman,et al.  Semiring Parsing , 1999, CL.

[10]  Liang Huang.  Binarization, Synchronous Binarization, and Target-side Binarization , 2007, SSST@HLT-NAACL.

[11]  Stephan Vogel,et al.  An Efficient Two-Pass Approach to Synchronous-CFG Driven Statistical MT , 2007, NAACL.

[12]  John DeNero,et al.  Asynchronous Binarization for Synchronous Grammars , 2009, ACL/IJCNLP.

[13]  John DeNero,et al.  Efficient Parsing for Transducer Grammars , 2009, HLT-NAACL.

[14]  Daniel Marcu,et al.  What’s in a translation rule? , 2004, NAACL.

[15]  Daniel Gildea,et al.  Issues Concerning Decoding with Synchronous Context-free Grammar , 2011, ACL.

[16]  Jason Eisner.  Expectation Semirings: Flexible EM for Learning Finite-State Transducers , 2001 .