David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
We present a system for deciding whether a given sentence can be inferred from text. Each sentence is represented as a directed graph (extracted from a dependency parser) in which the nodes represent words or phrases, and the links represent syntactic and semantic relationships. We develop a learned graph matching model to approximate entailment by the amount of the sentence’s semantic content which is contained in the text. We present results on the Recognizing Textual Entailment dataset (Dagan et al., 2005), and show that our approach outperforms Bag- Of-Words and TF-IDF models.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Rainer Kerth (1998). Isomorphism and Equational Equivalence of Continuous Λ-Models. Studia Logica 61 (3):403-415.
Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
Peter Spirtes, Thomas Richardson, Christopher Meek, Richard Scheines & Clark Glymour, Using D-Separation to Calculate Zero Partial Correlations in Linear Models with Correlated Errors.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Hans Lenk (1976). Handlungsgraphen. Grazer Philosophische Studien 2:159-172.
Dov M. Gabbay & Andrzej Szałas (2009). Annotation Theories Over Finite Graphs. Studia Logica 93 (2/3):147 - 180.
Sorry, there are not enough data points to plot this chart.
Added to index2010-12-22
Total downloads1 ( #672,433 of 1,780,586 )
Recent downloads (6 months)1 ( #291,765 of 1,780,586 )
How can I increase my downloads?