Convolutional neural network-based question answering over knowledge base with type constraint

Abstract

We propose a staged framework for question answering over a large-scale structured knowledge base. Following existing methods based on semantic parsing, our method relies on various components for solving different sub-tasks of the problem. In the first stage, we directly use the result of entity linking to obtain the topic entity in a question, and simplify the process as a semantic matching problem. We train a neural network to match questions and predicate sequences to get a rough set of candidate answer entities from the knowledge base. Unlike traditional methods, we also consider entity type as a constraint on candidate answers to remove wrong candidates from the rough set in the second stage. By applying a convolutional neural network model to match questions and predicate sequences and a type constraint to filter candidate answers, our method achieves an average F 1 measure of 74.8% on the WEBQUESTIONSSP dataset, it is competitive with state-of-the-art semantic parsing approaches.