Global Learning of Typed Entailment Rules

Extensive knowledge bases of entailment rules between predicates are crucial for applied semantic inference. In this paper we propose an algorithm that utilizes transitivity constraints to learn a globally-optimal set of entailment rules for typed predicates. We model the task as a graph learning problem and suggest methods that scale the algorithm to larger graphs. We apply the algorithm over a large data set of extracted predicate instances, from which a resource of typed entailment rules has been recently released (Schoenmackers et al., 2010). Our results show that using global transitivity information substantially improves performance over this resource and several baselines, and that our scaling methods allow us to increase the scope of global learning of entailment-rule graphs.

[1]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[2]  Marti A. Hearst.  Automatic Acquisition of Hyponyms from Large Text Corpora , 1992, COLING.

[3]  Arun Sharma,et al.  ILP with Noise and Fixed Example Size: A Bayesian Approach , 1997, IJCAI.

[4]  John B. Lowe,et al.  The Berkeley FrameNet Project , 1998, ACL.

[5]  Ralph Grishman,et al.  NOMLEX: a lexicon of nominalizations , 1998 .

[6]  Martha Palmer,et al.  Class-Based Construction of a Verb Lexicon , 2000, AAAI/IAAI.

[7]  Patrick Pantel,et al.  Discovery of inference rules for question-answering , 2001, Natural Language Engineering.

[8]  David J. Weir,et al.  A General Framework for Distributional Similarity , 2003, EMNLP.

[9]  Ido Dagan,et al.  Scaling Web-based Acquisition of Entailment Relations , 2004, EMNLP.

[10]  Satoshi Sekine,et al.  Automatic Paraphrase Discovery based on Context and Keywords between NE Pairs , 2005, IJCNLP.

[11]  Thorsten Joachims,et al.  A support vector method for multivariate performance measures , 2005, ICML.

[12]  Sebastian Riedel,et al.  Incremental Integer Linear Programming for Non-projective Dependency Parsing , 2006, EMNLP.

[13]  Daniel Jurafsky,et al.  Semantic Taxonomy Induction from Heterogenous Evidence , 2006, ACL.

[14]  Patrick Pantel,et al.  LEDIR: An Unsupervised Algorithm for Learning Directionality of Inference Rules , 2007, EMNLP.

[15]  Taghi M. Khoshgoftaar,et al.  Experimental perspectives on learning from imbalanced data , 2007, ICML '07.

[16]  J. Clarke,et al.  Global inference for sentence compression : an integer linear programming approach , 2008, J. Artif. Intell. Res..

[17]  Vladimir Nikulin.  Classification of Imbalanced Data with Random sets and Mean-Variance Filtering , 2008, Int. J. Data Warehous. Min..

[18]  Oren Etzioni,et al.  Open Information Extraction from the Web , 2007, CACM.

[19]  Ido Dagan,et al.  Learning Entailment Rules for Unary Templates , 2008, COLING.

[20]  Christopher D. Manning,et al.  Enforcing Transitivity in Coreference Resolution , 2008, ACL.

[21]  Ido Dagan,et al.  Recognizing textual entailment: Rational, evaluation and approaches , 2009, Natural Language Engineering.

[22]  Eric P. Xing,et al.  Concise Integer Linear Programming Formulations for Dependency Parsing , 2009, ACL.

[23]  Oren Etzioni,et al.  Unsupervised Methods for Determining Object and Relation Synonyms on the Web , 2014, J. Artif. Intell. Res..

[24]  Ido Dagan,et al.  Augmenting WordNet-based Inference with Argument Mapping , 2009, TextInfer@ACL.

[25]  Dan Roth,et al.  Constraints Based Taxonomic Relation Classification , 2010, EMNLP.

[26]  Daniel S. Weld,et al.  Temporal Information Extraction , 2010, AAAI.

[27]  Vladimir Nikulin.  Classification of Imbalanced Data with Random Sets and Mean-Variance Filtering. , 2010 .

[28]  Ido Dagan,et al.  Global Learning of Focused Entailment Graphs , 2010, ACL.

[29]  Oren Etzioni,et al.  Learning First-Order Horn Clauses from Web Text , 2010, EMNLP.

[30]  Ido Dagan,et al.  Generating Entailment Rules from FrameNet , 2010, ACL.

[31]  Pedro M. Domingos,et al.  Unsupervised Ontology Induction from Text , 2010, ACL.