论文信息 - Efficient Search for Inversion Transduction Grammar

Efficient Search for Inversion Transduction Grammar

We develop admissible A* search heuristics for synchronous parsing with Inversion Transduction Grammar, and present results both for bitext alignment and for machine translation decoding. We also combine the dynamic programming hook trick with A* search for decoding. These techniques make it possible to find optimal alignments much more quickly, and make it possible to find optimal translations for the first time. Even in the presence of pruning, we are able to achieve higher BLEU scores with the same amount of computation.

Daniel Gildea | Hao Zhang | Hao Zhang | D. Gildea

[1] Daniel Gildea,et al. Machine Translation as Lexicalized Parsing with Hooks , 2005, IWPT.

[2] Daniel Gildea,et al. Stochastic Lexicalized Inversion Transduction Grammar for Alignment , 2005, ACL.

[3] Robert L. Mercer,et al. The Mathematics of Statistical Machine Translation: Parameter Estimation , 1993, CL.

[4] Giorgio Satta,et al. Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars , 1999, ACL.

[5] Hermann Ney,et al. An Efficient A* Search Algorithm for Statistical Machine Translation , 2001, DDMMT@ACL.

[6] Dan Klein,et al. A* Parsing: Fast Exact Viterbi Parse Selection , 2003, NAACL.

[7] Alexander H. Waibel,et al. Decoding Algorithm in Statistical Machine Translation , 1997, ACL.

[8] Eugene Charniak,et al. Edge-Based Best-First Chart Parsing , 1998, VLC@COLING/ACL.

[9] Michael Collins,et al. Head-Driven Statistical Models for Natural Language Parsing , 2003, CL.

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

[11] Hermann Ney,et al. A Comparative Study on Reordering Constraints in Statistical Machine Translation , 2003, ACL.

[12] Dekai Wu,et al. A Polynomial-Time Algorithm for Statistical Machine Translation , 1996, ACL.