Data-driven construction of SPARQL queries by approximate question graph alignment in question answering over knowledge graphs. (15th May 2020)

• Record Type: Journal Article
• Authors: Bakhshi, Mahdi; Nematbakhsh, Mohammadali; Mohsenzadeh, Mehran; Rahmani, Amir Masoud
• Is Part Of: Expert systems with applications. Volume 146(2020)
• Publication Date: 2020-05-15
• Subjects: Knowledge graph -- Answering natural language questions -- Disambiguation of interpretations -- Pairwise graph alignment; Expert systems (Computer science) -- Periodicals; Systèmes experts (Informatique) -- Périodiques; Electronic journals; 006.33
• DOI: 10.1016/j.eswa.2020.113205
• Languages: English
• ISSNs: 0957-4174

Abstract

Highlights: Extracting the query graph patterns directly from the knowledge graph is proposed. Pairwise graph alignment-based method verifies the interpretations of a question. Relying on the intermediate semantic items is reduced to as least as possible. The lexical and structural approximation causes flexibility in finding matches. Results show a significant increase in the number of questions answered correctly. Abstract: As increasingly more semantic real-world data is stored in knowledge graphs, providing intuitive and effective query methods for end-users is a fundamental and challenging task. Since there is a gap between the plain natural language question (NLQ) and structured data, most RDF question/answering (Q/A) systems construct SPARQL queries from NLQs and obtain precise answers from knowledge graphs. A major challenge is how to disambiguate the mapping of phrases and relations in a question to the dataset items, especially in complex questions. In this paper, we propose a novel data-driven graph similarity framework for RDF Q/A to extract the query graph patterns directly from the knowledge graph instead of constructing them with semantically mapped items. An uncertain question graph is presented to model the interpretations of an NLQ, based on which our problem is reduced to a graph alignment problem. In formulating the alignment, both the lexical and structural similarity of graphs are considered, hence, the target RDF subgraph is used as a query graph pattern to construct the final query. We create a pruned entity graph dynamically based on the complexity of an input question to reduce the search space on the knowledge graph. Moreover, to reduce the calculating cost of the graph similarity, we compute the similarity scores only for same-distance graph elements and equip the process with an edge association-aware surface form extraction method. Empirical studies over real datasets indicate that our proposed approach is flexible and effective as it outperforms state-of-the-art methods significantly.