Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Discovery of inference rules for question-answering
Natural Language Engineering
Learning surface text patterns for a Question Answering system
ACL '02 Proceedings of the 40th 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
Preemptive information extraction using unrestricted relation discovery
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
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
Unsupervised methods for determining object and relation synonyms on the web
Journal of Artificial Intelligence Research
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
Unsupervised ontology induction from text
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
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
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
Identifying relations for open information extraction
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
An investigation into the application of ensemble learning for entailment classification
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
Learning entailment rules is fundamental in many semantic-inference applications and has been an active field of research in recent years. In this paper we address the problem of learning transitive graphs that describe entailment rules between predicates (termed entailment graphs). We first identify that entailment graphs exhibit a "tree-like" property and are very similar to a novel type of graph termed forest-reducible graph. We utilize this property to develop an iterative efficient approximation algorithm for learning the graph edges, where each iteration takes linear time. We compare our approximation algorithm to a recently-proposed state-of-the-art exact algorithm and show that it is more efficient and scalable both theoretically and empirically, while its output quality is close to that given by the optimal solution of the exact algorithm.