Automatic learning of textual entailments with cross-pair similarities

  • Authors:
  • Fabio Massimo Zanzotto;Alessandro Moschitti

  • Affiliations:
  • University of Milano-Bicocca, Milan, Italy;University of Rome "Tor Vergata", Rome, Italy

  • Venue:
  • ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we define a novel similarity measure between examples of textual entailments and we use it as a kernel function in Support Vector Machines (SVMs). This allows us to automatically learn the rewrite rules that describe a non trivial set of entailment cases. The experiments with the data sets of the RTE 2005 challenge show an improvement of 4.4% over the state-of-the-art methods.