pith. sign in

arxiv: 1510.04780 · v2 · pith:5VLAW5K4new · submitted 2015-10-16 · 💻 cs.CL · cs.IR

A Graph Traversal Based Approach to Answer Non-Aggregation Questions Over DBpedia

classification 💻 cs.CL cs.IR
keywords methodnon-aggregationqueryanswerbasecompareddatasetdbpedia
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.