A graph traversal based approach to answer non-aggregation questions over DBpedia

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

Abstract

We present a question answering system over DBpedia, filling the gap between user information needs expressed in natural language and a structured query interface expressed in SPARQL over the underlying knowledge base (KB). Given the KB, our goal is to comprehend a natural language query and provide corresponding accurate answers. Focusing on solving the non-aggregation questions, in this paper, we construct a subgraph of the knowledge base from the detected entities and propose a graph traversal method to solve both the semantic item mapping problem and the disambiguation problem in a joint way. Compared with existing work, we simplify the process of query intention understanding and pay more attention to the answer path ranking. We evaluate our method on a non-aggregation question dataset and further on a complete dataset. Experimental results show that our method achieves best performance compared with several state-of-the-art systems.

Cite

CITATION STYLE

APA

Zhu, C., Ren, K., Liu, X., Wang, H., Tian, Y., & Yu, Y. (2016). A graph traversal based approach to answer non-aggregation questions over DBpedia. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9544, pp. 219–234). Springer Verlag. https://doi.org/10.1007/978-3-319-31676-5_16

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