Abstract
This paper describes a predominantly shallow ap-proach to the rte-4 Challenge. We focus our at-tention 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.
Original language | English |
---|---|
Title of host publication | Proceedings of the Fourth PASCAL Challenges Workshop on Recognizing Textual Entailment |
Number of pages | 8 |
Publication status | Published - 2008 |