A Dependency-based Word Subsequence Kernel (2008)
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 based on word dependencies. It overcomes some of the difficulties encountered by syntactic tree kernels as well. Experimental results demonstrate the advantage of this kernel over word subsequence and syntactic tree kernels.
In Proceedings of the conference on Empirical Methods in Natural Language Processing (EMNLP-2008), pp. 400--409, Waikiki, Honolulu, Hawaii, October 2008.

Rohit Kate Postdoctoral Alumni katerj [at] uwm edu