Polyhedral characterization of discrete dynamic programming
Operations Research
Communications of the ACM
Forest-based statistical sentence generation
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
A hierarchical phrase-based model for statistical machine translation
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Left-to-right target generation for hierarchical phrase-based translation
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Local phrase reordering models for statistical machine translation
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
A fast finite-state relaxation method for enforcing global constraints on sequence decoding
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
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Rule filtering by pattern for efficient hierarchical translation
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for 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
Incremental integer linear programming for non-projective dependency parsing
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Coarse-to-fine syntactic machine translation using language projections
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Dependency parsing by belief propagation
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
On dual decomposition and linear programming relaxations for natural language processing
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Efficient incremental decoding for tree-to-string translation
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Dual decomposition for parsing with non-projective head automata
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Hierarchical phrase-based translation with weighted finite-state transducers and shallow-n grammars
Computational Linguistics
MAP estimation via agreement on trees: message-passing and linear programming
IEEE Transactions on Information Theory
Dual decomposition for natural language processing
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Exact decoding of phrase-based translation models through Lagrangian relaxation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Dual decomposition with many overlapping components
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Hierarchical phrase-based translation representations
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Syntax-based word ordering incorporating a large-scale language model
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Implicitly intersecting weighted automata using dual decomposition
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Unified expectation maximization
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
An exact dual decomposition algorithm for shallow semantic parsing with constraints
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable sub-problems, thereby avoiding exhaustive dynamic programming. The method recovers exact solutions, with certificates of optimality, on over 97% of test examples; it has comparable speed to state-of-the-art decoders.