Sciweavers

Share
7 search results - page 1 / 2
» Asynchronous Binarization for Synchronous Grammars
Sort
View
ACL
2009
10 years 11 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
ACL
2011
10 years 5 months ago
Issues Concerning Decoding with Synchronous Context-free Grammar
We discuss some of the practical issues that arise from decoding with general synchronous context-free grammars. We examine problems caused by unary rules and we also examine how ...
Tagyoung Chung, Licheng Fang, Daniel Gildea
EMNLP
2009
10 years 11 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...
EMNLP
2010
10 years 11 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
ACL
2011
10 years 5 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
books