Synchronous tree adjoining machine translation
2009Vol. 2, pp. 727–727
Citations Over TimeTop 1% of 2009 papers
Abstract
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves translation quality without becoming computationally intractable. Using adjoining to model optionality allows general translation patterns to be learned without the clutter of endless variations of optional material. The appropriate modifiers can later be spliced in as needed.
Related Papers
- → ParaMT: A Paraphraser for Machine Translation(2008)13 cited
- → Machine translation based on logically isomorphic Montague grammars(1982)21 cited
- → Generate and Repair Machine Translation(2002)9 cited
- Obtaining Word Phrases with Stochastic Inversion Translation Grammars for Phrase-based Statistical Machine Translation.(2006)
- A Prototype System for Machine Translation from English to South African Sign Language using Synchronous Tree Adjoining Grammars(2007)