Discovery of inference rules for question-answering
Natural Language Engineering
Findex: search result categories help users when document ranking fails
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A support vector method for multivariate performance measures
ICML '05 Proceedings of the 22nd international conference on Machine learning
Integer linear programming inference for conditional random fields
ICML '05 Proceedings of the 22nd international conference on Machine learning
Evaluating WordNet-based Measures of Lexical Semantic Relatedness
Computational Linguistics
Contrastive estimation: training log-linear models on unlabeled data
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Semantic taxonomy induction from heterogenous evidence
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Experimental perspectives on learning from imbalanced data
Proceedings of the 24th international conference on Machine learning
Context Sensitive Paraphrasing with a Global Unsupervised Classifier
ECML '07 Proceedings of the 18th European conference on Machine Learning
Enforcing transitivity in coreference resolution
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Learning entailment rules for unary templates
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Global inference for sentence compression an integer linear programming approach
Journal of Artificial Intelligence Research
Unsupervised methods for determining object and relation synonyms on the web
Journal of Artificial Intelligence Research
The cluster-abstraction model: unsupervised learning of topic hierarchies from text data
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
The WEKA data mining software: an update
ACM SIGKDD Explorations Newsletter
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
Augmenting WordNet-based inference with argument mapping
TextInfer '09 Proceedings of the 2009 Workshop on Applied Textual Inference
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
Unsupervised entailment detection between dependency graph fragments
BioNLP '11 Proceedings of BioNLP 2011 Workshop
Learning entailment relations by global graph structure optimization
Computational Linguistics
Training dependency parsers by jointly optimizing multiple objectives
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Entailment-based text exploration with application to the health-care domain
ACL '12 Proceedings of the ACL 2012 System Demonstrations
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
Crowdsourcing inference-rule evaluation
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
An inference-based model of word meaning in context as a paraphrase distribution
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Sections on Paraphrasing; Intelligent Systems for Socially Aware Computing; Social Computing, Behavioral-Cultural Modeling, and Prediction
| Hi-index | 0.00 |
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed edges, and use a global transitivity constraint on the graph to learn the optimal set of edges, by formulating the optimization problem as an Integer Linear Program. We motivate this graph with an application that provides a hierarchical summary for a set of propositions that focus on a target concept, and show that our global algorithm improves performance by more than 10% over baseline algorithms.