Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Introduction to algorithms
Bootstrap percolation, the Schro¨der numbers, and the N-kings problem
SIAM Journal on Discrete Mathematics
Treewidth for graphs with small chordality
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
Computational Linguistics
A polynomial-time algorithm for statistical machine translation
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Multitext Grammars and synchronous parsers
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Learning non-isomorphic tree mappings for machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
The Alignment Template Approach to Statistical Machine Translation
Computational Linguistics
An evaluation exercise for word alignment
HLT-NAACL-PARALLEL '03 Proceedings of the HLT-NAACL 2003 Workshop on Building and using parallel texts: data driven machine translation and beyond - Volume 3
A hierarchical phrase-based model for statistical machine translation
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Log-linear models for word alignment
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Empirical lower bounds on the complexity of translational equivalence
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
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
Factorization of synchronous context-free grammars in linear time
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Binarization, synchronous binarization, and target-side binarization
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Machine translation as lexicalized parsing with hooks
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Phrase translation probabilities with ITG priors and smoothing as learning objective
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Asynchronous binarization for synchronous grammars
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Two monolingual parses are better than one (synchronous parse)
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Why synchronous tree substitution grammars?
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Constituency to dependency translation with forests
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Grammar factorization by tree decomposition
Computational Linguistics
An alternative to synchronous tree substitution grammars*
Natural Language Engineering
Optimal head-driven parsing complexity for linear context-free rewriting systems
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
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
A generalized view on parsing and translation
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Natural Language Engineering
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Systems based on synchronous grammars and tree transducers promise to improve the quality of statistical machine translation output, but are often very computationally intensive. The complexity is exponential in the size of individual grammar rules due to arbitrary re-orderings between the two languages. We develop a theory of binarization for synchronous context-free grammars and present a linear-time algorithm for binarizing synchronous rules when possible. In our large-scale experiments, we found that almost all rules are binarizable and the resulting binarized rule set significantly improves the speed and accuracy of a state-of-the-art syntax-based machine translation system. We also discuss the more general, and computationally more difficult, problem of finding good parsing strategies for non-binarizable rules, and present an approximate polynomial-time algorithm for this problem.