ClearTK/cleartk

Implement Semantic-Syntactic Tree Kernel (SSTK)

Closed this issue · 1 comments

Original issue 413 created by ClearTK on 2015-01-21T20:21:58.000Z:

This is a kernel where the lexical items are compared using a similarity function rather than just enforcing equality. For example you could use LSA or word2vec to get word vectors and then the lexical similarity function is cosine similarity between the vectors. Similar to subset tree kernel but should smooth over lexical variation.

Citation:
Bloehdorn, Stephan, and Alessandro Moschitti. "Combined Syntactic and Semantic Kernels for Text Classification." Advances in Information Retrieval: 29th European Conference on IR Research, ECIR 2007, Rome, Italy, April 2-5, 2007, Proceedings. Vol. 4425. Springer, 2007.

Comment #1 originally posted by ClearTK on 2015-02-03T20:23:29.000Z:

<empty>