Bootstrap percolation, the Schro¨der numbers, and the N-kings problem
SIAM Journal on Discrete Mathematics
A hierarchical phrase-based model for statistical machine translation
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Scalable inference and training of context-rich syntactic translation models
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Some computational complexity results for synchronous context-free grammars
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Multilevel coarse-to-fine PCFG parsing
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Synchronous binarization for machine translation
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Hierarchical Phrase-Based Translation
Computational Linguistics
SPMT: statistical machine translation with syntactified target language phrases
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Better binarization for the CKY parsing
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Binarization, synchronous binarization, and target-side binarization
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Iterative CKY parsing for probabilistic context-free grammars
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Boosting-based system combination for machine translation
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
An empirical study of translation rule extraction with multiple parsers
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Terminal-aware synchronous binarization
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Using categorial grammar to label translation rules
WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation
Bagging and Boosting statistical machine translation systems
Artificial Intelligence
| Hi-index | 0.00 |
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In this paper, we first investigate the excess edge competition issue caused by a left-heavy binary SCFG derived with the method of Zhang et al. (2006). Then we propose a new binarization method to mitigate the problem by exploring other alternative equivalent binary SCFGs. We present an algorithm that iteratively improves the resulting binary SCFG, and empirically show that our method can improve a string-to-tree statistical machine translations system based on the synchronous binarization method in Zhang et al. (2006) on the NIST machine translation evaluation tasks.