A Dependency-based Word Subsequence Kernel


This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very efficient algorithm to compute it. This kernel is also an improvement over the word subsequence kernel because it only counts linguistically meaningful word subsequences which are… (More)

5 Figures and Tables


  • Presentations referencing similar topics