Recognising Textual Entailment Focusing on Non-Entailing Text and Hypothesis (original) (raw)

2008

Abstract This paper describes a predominantly shallow approach to the rte-4 Challenge. We focus our attention on the non-entailing Text and Hypothesis pairs in the dataset. The system uses a Maximum Entropy framework to classify each pair of Text and Hypothesis as either yes or no, using a range of different feature sets based on an analysis of the existing non-entailing pairs in rte training data.

Recognizing textual entailment using a machine learning approach

2010

We present our experiments on Recognizing Textual Entailment based on modeling the entailment relation as a classification problem. As features used to classify the entailment pairs we use a symmetric similarity measure and a non-symmetric similarity measure. Our system achieved an accuracy of 66% on the RTE-3 development dataset (with 10-fold cross validation) and accuracy of 63% on the RTE-3 test dataset.

Recognizing Textual Entailment

Since 2005, researchers have worked on a broad task called Recognizing Textual Entailment (RTE), which is designed to focus efforts on general textual inference capabilities, but without constraining participants to use a specific representation or reasoning approach. There have been promising developments in this sub-field of Natural Language Processing (NLP), with systems showing steady improvement, and investigations of a range of approaches to the problem.

This document is currently being converted. Please check back in a few minutes.