Loosely Tree-Based Alignment for Machine Translation

We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computational complexity polynomial in the sentence length. This is done by adding a new subtree cloning operation to either tree-to-string or tree-to-tree alignment algorithms.

• Type: Conference
• Year: 2003
• Where: ACL
• Authors: Daniel Gildea
• Keywords: ACL 2003, ACL 2007, Computational Complexity Polynomial, Original Tree Structure, Re-ordering Nodes