Ranking kernels for structures and embeddings: A hybrid preference and classification model

11Citations
Citations of this article
95Readers
Mendeley users who have this article in their library.

Abstract

Recent work has shown that Tree Kernels (TKs) and Convolutional Neural Networks (CNNs) obtain the state of the art in answer sentence reranking. Additionally, their combination used in Support Vector Machines (SVMs) is promising as it can exploit both the syntactic patterns captured by TKs and the embeddings learned by CNNs. However, the embeddings are constructed according to a classification function, which is not directly exploitable in the preference ranking algorithm of SVMs. In this work, we propose a new hybrid approach combining preference ranking applied to TKs and pointwise ranking applied to CNNs. We show that our approach produces better results on two well-known and rather different datasets: WikiQA for answer sentence selection and SemEval cQA for comment selection in Community Question Answering.

Cite

CITATION STYLE

APA

Tymoshenko, K., Bonadiman, D., & Moschitti, A. (2017). Ranking kernels for structures and embeddings: A hybrid preference and classification model. In EMNLP 2017 - Conference on Empirical Methods in Natural Language Processing, Proceedings (pp. 897–902). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/d17-1093

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free