Spanning trees in hypergraphs with applications to steiner trees
Spanning trees in hypergraphs with applications to steiner trees
Fast decoding and optimal decoding for machine translation
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Introduction to Mathematical Programming: Applications and Algorithms
Introduction to Mathematical Programming: Applications and Algorithms
Dependency tree kernels for relation extraction
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Online large-margin training of dependency parsers
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Machine translation using probabilistic synchronous dependency insertion grammars
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Non-projective dependency parsing using spanning tree algorithms
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Multilingual dependency analysis with a two-stage discriminative parser
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Polyhedral outer approximations with application to natural language parsing
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Dependency parsing by belief propagation
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Unsupervised constraint driven learning for transliteration discovery
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Revisiting optimal decoding for machine translation IBM model 4
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
On the complexity of non-projective data-driven dependency parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Global inference for sentence compression an integer linear programming approach
Journal of Artificial Intelligence Research
Concise integer linear programming formulations for dependency parsing
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
A study of global inference algorithms in multi-document summarization
ECIR'07 Proceedings of the 29th European conference on IR research
An efficient algorithm for easy-first non-directional dependency parsing
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Relaxed marginal inference and its application to dependency parsing
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
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
Uptraining for accurate deterministic question parsing
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
Very high accuracy and fast dependency parsing is not a contradiction
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Discourse constraints for document compression
Computational Linguistics
Analyzing and integrating dependency parsers
Computational Linguistics
Exact decoding of syntactic translation models through Lagrangian relaxation
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Global learning of typed entailment rules
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Learning entailment relations by global graph structure optimization
Computational Linguistics
Semi-supervised semantic role labeling via structural alignment
Computational Linguistics
Fast and robust joint models for biomedical event extraction
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Exact decoding of phrase-based translation models through Lagrangian relaxation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A joint model for extended semantic role labeling
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
Structural opinion mining for graph-based sentiment representation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Efficient tree-based approximation for entailment graph learning
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Generalized higher-order dependency parsing with cube pruning
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Parse, price and cut: delayed column and row generation for graph based parsers
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
On amortizing inference cost for structured prediction
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Journal of Artificial Intelligence Research
Morphological and syntactic case in statistical dependency parsing
Computational Linguistics
Divisible transition systems and multiplanar dependency parsing
Computational Linguistics
| Hi-index | 0.00 |
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such as non-projective dependency parsing and machine translation, the complete formulation of the decoding problem as an integer linear program renders solving intractable. We present an approach which solves the problem incrementally, thus we avoid creating intractable integer linear programs. This approach is applied to Dutch dependency parsing and we show how the addition of linguistically motivated constraints can yield a significant improvement over state-of-the-art.