Sciweavers

Share
7 search results - page 1 / 2
» Terminal-Aware Synchronous Binarization
Sort
View
ACL
2011
8 years 3 months ago
Terminal-Aware Synchronous Binarization
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...
Licheng Fang, Tagyoung Chung, Daniel Gildea
ACL
2009
8 years 9 months ago
Asynchronous Binarization for Synchronous Grammars
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 ...
John DeNero, Adam Pauls, Dan Klein
EMNLP
2009
8 years 9 months ago
Better Synchronous Binarization for Machine Translation
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...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
ACL
2011
8 years 3 months ago
Binarized Forest to String Translation
Tree-to-string translation is syntax-aware and ef´Čücient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
Hao Zhang, Licheng Fang, Peng Xu, Xiaoyun Wu
EMNLP
2010
8 years 10 months ago
SCFG Decoding Without Binarization
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...
Mark Hopkins, Greg Langmead
books