Class-Based Construction of a Verb Lexicon
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Discovery of inference rules for question-answering
Natural Language Engineering
Automatic retrieval and clustering of similar words
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A categorial variation database for English
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
A support vector method for multivariate performance measures
ICML '05 Proceedings of the 22nd international conference on Machine learning
A general framework for distributional similarity
EMNLP '03 Proceedings of the 2003 conference on Empirical methods in natural language processing
Evaluating WordNet-based Measures of Lexical Semantic Relatedness
Computational Linguistics
Computing locally coherent discourses
ACL '04 Proceedings of the 42nd Annual Meeting on Association for 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
Integrating pattern-based and distributional similarity methods for lexical entailment acquisition
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Experimental perspectives on learning from imbalanced data
Proceedings of the 24th international conference on Machine learning
Discovery of event entailment knowledge from text corpora
Computer Speech and Language
Adding predicate argument structure to the Penn TreeBank
HLT '02 Proceedings of the second international conference on Human Language Technology Research
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
Incremental integer linear programming for non-projective dependency parsing
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Robust textual inference via learning and abductive reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Semantic inference at the lexical-syntactic level
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - 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
Inferring textual entailment with a probabilistically sound calculus*
Natural Language Engineering
On the role of lexical and world knowledge in RTE3
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
The WEKA data mining software: an update
ACM SIGKDD Explorations Newsletter
LexPar: A Freely Available English Paraphrase Lexicon Automatically Extracted from FrameNet
ICSC '09 Proceedings of the 2009 IEEE International Conference on Semantic Computing
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 focused entailment graphs
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Generating entailment rules from FrameNet
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Learning first-order Horn clauses from web text
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Constraints based taxonomic relation classification
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Directional distributional similarity for lexical inference
Natural Language Engineering
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 verb inference rules from linguistically-motivated evidence
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Collaboratively built semi-structured content and Artificial Intelligence: The story so far
Artificial Intelligence
| Hi-index | 0.00 |
Identifying entailment relations between predicates is an important part of applied semantic inference. In this article we propose a global inference algorithm that learns such entailment rules. First, we define a graph structure over predicates that represents entailment relations as directed edges. Then, we use a global transitivity constraint on the graph to learn the optimal set of edges, formulating the optimization problem as an Integer Linear Program. The algorithm is applied in a setting where, given a target concept, the algorithm learns on the fly all entailment rules between predicates that co-occur with this concept. Results show that our global algorithm improves performance over baseline algorithms by more than 10%.