Proceedings

A Probabilistic Lexical Approach to Textual Entailment

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1682-1682.

© 2005 International Joint Conferences on Artificial Intelligence

Abstract

The textual entailment problem is to determine if a given text entails a given hypothesis. This paper describes first a general generative probabilistic setting for textual entailment. We then focus on the sub-task of recognizing whether the lexical concepts present in the hypothesis are entailed from the text. This problem is recast as one of text categorization in which the classes are the vocabulary words. We make novel use of Naïve Bayes to model the problem in an entirely unsupervised fashion. Empirical tests suggest that the method is effective and compares favorably with state-of-theart heuristic scoring approaches.

  1. [Dagan et al., 2005] Ido Dagan, Oren Glickman and Bernardo Magnini. The PASCAL Recognising Textual Entailment Challenge. PASCAL Challenges Workshop.
  2. [McCallum and Nigam, 1998] Andrew McCallum and Ka- mal Nigam. A Comparison of Event Models for Naive Bayes Text Classification. AAAI-98 Workshop on "Learning for Text Categorization".
  3. [Munz and de Rijke, 2001] Christof Monz, Maarten de Ri- jke. Light-Weight Entailment Checking for Computa- tional Semantics. The third workshop on inference in computational semantics (ICoS-3).
  4. [Saggion et al., 2004] Horacio Saggion, Rob Gaizauskas, Mark Hepple, Ian Roberts and Mark A. Greenwood. Ex- ploring the Performance of Boolean Retrieval Strategies For Open Domain Question Answering. SIGIR04 Work- shop on Information Retrieval for Question Answering.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards