Empirical Lower Bounds on the Complexity of Translational Equivalence

This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext was higher than suggested in the literature. These findings shed new light on why "syntactic" constraints have not helped to improve statistical translation models, including finitestate phrase-based models, tree-to-string models, and tree-to-tree models. The paper also presents evidence that inversion transduction grammars cannot generate some translational equivalence relations, even in relatively simple real bitexts in syntactically similar languages with rigid word order. Instructions for replicating our experiments are at http://nlp.cs.nyu.edu/GenPar/ACL06

• Type: Conference
• Year: 2006
• Where: ACL
• Authors: Benjamin Wellington, Sonjia Waxmonsky, I. Dan Melamed
• Keywords: ACL 2006, ACL 2007, Finitestate Phrase-based Models, Translational Equivalence, Translational Equivalence Relations