An efficient context-free parsing algorithm
Communications of the ACM
A systematic comparison of various statistical alignment models
Computational Linguistics
Computational Linguistics
Forest-based statistical sentence generation
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Three heads are better than one
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
Generation that exploits corpus-based statistical knowledge
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
BLEU: a method for automatic evaluation of machine translation
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A survey on tree edit distance and related problems
Theoretical Computer Science
Multi-engine machine translation with voted language model
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Multi-engine machine translation guided by explicit word matching
ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
Hierarchical Phrase-Based Translation
Computational Linguistics
Translation as weighted deduction
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Indirect-HMM-based hypothesis alignment for combining outputs from machine translation systems
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Efficient extraction of oracle-best translations from hypergraphs
NAACL-Short '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers
Comparing reordering constraints for SMT using efficient Bleu oracle computation
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
StatMT '08 Proceedings of the Third Workshop on Statistical Machine Translation
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Joint decoding with multiple translation models
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Model combination for machine translation
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
WMT '10 Proceedings of the Joint Fifth Workshop on Statistical Machine Translation and MetricsMATR
| Hi-index | 0.00 |
The state-of-the-art system combination method for machine translation (MT) is based on confusion networks constructed by aligning hypotheses with regard to word similarities. We introduce a novel system combination framework in which hypotheses are encoded as a confusion forest, a packed forest representing alternative trees. The forest is generated using syntactic consensus among parsed hypotheses: First, MT outputs are parsed. Second, a context free grammar is learned by extracting a set of rules that constitute the parse trees. Third, a packed forest is generated starting from the root symbol of the extracted grammar through non-terminal rewriting. The new hypothesis is produced by searching the best derivation in the forest. Experimental results on the WMT10 system combination shared task yield comparable performance to the conventional confusion network based method with smaller space.