Semantic question matching in data constrained environment

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Machine comprehension of various forms of semantically similar questions with same or similar answers has been an ongoing challenge. Especially in many industrial domains with limited set of questions, it is hard to identify proper semantic match for a newly asked question having the same answer but presented in different lexical form. This paper proposes a linguistically motivated taxonomy for English questions and an effective approach for question matching by combining deep learning models for question representations with general taxonomy based features. Experiments performed on short datasets demonstrate the effectiveness of the proposed approach as better matching classification was observed by coupling the standard distributional features with knowledge-based methods.

Cite

CITATION STYLE

APA

Maitra, A., Sengupta, S., Mukhopadhyay, A., Gupta, D., Pujari, R., Bhattacharya, P., … Jain, T. G. (2018). Semantic question matching in data constrained environment. In Lecture Notes in Computer Science (Vol. 11107 LNAI, pp. 267–276). Springer Verlag. https://doi.org/10.1007/978-3-030-00794-2_29

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