Learning Textual Graph Patterns to Detect Causal Event Relations

This paper presents a novel method for discovering causal relations between events encoded in text. In order to determine if two events from the same sentence are in a causal relation or not, we first build a graph representation of the sentence that encodes lexical, syntactic, and semantic information. In a second step, we automatically extract multiple graph patterns (or subgraphs) from such graph representations and sort them according to their relevance in determining the causality between two events from the same sentence. Finally, in order to decide if these events are causal or not, we train a binary classifier based on what graph patterns can be mapped to the graph representation associated with the two events. Our experimental results show that capturing the feature dependencies of causal event relations using a graph representation significantly outperforms an existing method that uses a flat representation of features.

[1]  J. Feldman,et al.  Karma: knowledge-based active representations for metaphor and aspect , 1997 .

[2]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[3]  Peter D. Turney,et al.  SemEval-2007 Task 04: Classification of Semantic Relations between Nominals , 2007, *SEMEVAL.

[4]  Roxana Gîrju,et al.  Automatic Detection of Causal Relations for Question Answering , 2003, ACL 2003.

[5]  Marti A. Hearst Automated Discovery of WordNet Relations , 2004 .

[6]  Cosmin Adrian Bejan,et al.  UTD-SRL: A Pipeline Architecture for Extracting Frame Semantic Structures , 2007, SemEval@ACL.

[7]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[8]  James H. Martin,et al.  Building a Corpus of Temporal-Causal Structure , 2008, LREC.

[9]  R. Girju,et al.  A knowledge-rich approach to identifying semantic relations between nominals , 2010, Inf. Process. Manag..

[10]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[11]  Philip S. Yu,et al.  Near-optimal Supervised Feature Selection among Frequent Subgraphs , 2009, SDM.

[12]  Eduard H. Hovy,et al.  Learning surface text patterns for a Question Answering System , 2002, ACL.

[13]  Christian Böhm,et al.  Frequent subgraph discovery in dynamic networks , 2010, MLG '10.

[14]  Syin Chan,et al.  Extracting Causal Knowledge from a Medical Database Using Graphical Patterns , 2000, ACL.

[15]  James H. Martin,et al.  Learning Semantic Links from a Corpus of Parallel Temporal and Causal Relations , 2008, ACL.

[16]  Patrick Pantel,et al.  VerbOcean: Mining the Web for Fine-Grained Semantic Verb Relations , 2004, EMNLP.

[17]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[18]  Erik T. Mueller,et al.  Modelling Space and Time in Narratives about Restaurants , 2007, Lit. Linguistic Comput..

[19]  Joost N. Kok,et al.  The Gaston Tool for Frequent Subgraph Mining , 2005, GraBaTs.

[20]  William W. Cohen Learning Trees and Rules with Set-Valued Features , 1996, AAAI/IAAI, Vol. 1.

[21]  Dan I. Moldovan,et al.  Mining Answers for Causation Questions , 2002 .

[22]  Preslav Nakov,et al.  SemEval-2007 Task 04: Classification of Semantic Relations between Nominals , 2007, Fourth International Workshop on Semantic Evaluations (SemEval-2007).

[23]  Rada Mihalcea,et al.  SenseLearner: Word Sense Disambiguation for All Words in Unrestricted Text , 2005, ACL.