Efficient kernels for sentence pair classification

  • Authors:
  • Fabio Massimo Zanzotto;Lorenzo Dell'Arciprete

  • Affiliations:
  • University of Rome "Tor Vergata", Roma, Italy;University of Rome "Tor Vergata", Roma, Italy

  • Venue:
  • EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We introduce a novel algorithm for computing the similarity in first-order rewrite rule feature spaces. Our algorithm is extremely efficient and, as it computes the similarity of instances that can be represented in explicit feature spaces, it is a valid kernel function.