10 search results - page 2 / 2 » Improving Decoding Generalization for Tree-to-String Transla... |
106
click to vote
ACL
2009
14 years 11 months ago
2009
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
108
click to vote
LREC
2010
15 years 3 months ago
2010
Recent developments on hybrid systems that combine rule-based machine translation (RBMT) systems with statistical machine translation (SMT) generally neglect the fact that RBMT sy...
111
click to vote
EMNLP
2009
14 years 11 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
158
click to vote
ACL
2011
14 years 5 months ago
2011
This paper extends the training and tuning regime for phrase-based statistical machine translation to obtain fluent translations into morphologically complex languages (we build ...
147
click to vote
CASES
2005
ACM
15 years 4 months ago
2005
ACM
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...