7 search results - page 1 / 2 » Terminal-Aware Synchronous Binarization |
ACL
2011
12 years 8 months ago
2011
We present an SCFG binarization algorithm that combines the strengths of early terminal matching on the source language side and early language model integration on the target lan...
ACL
2009
13 years 2 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 ...
EMNLP
2009
13 years 2 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
EMNLP
2010
13 years 2 months ago
2010
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
NAACL
2010
13 years 2 months ago
2010
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...