gMatch: Knowledge base question answering via semantic matching

• Published in: Knowledge-based systems 2021-09, Vol.228, p.107270, Article 107270
• Main Authors: Jiao, Jie, Wang, Shujun, Zhang, Xiaowang, Wang, Longbiao, Feng, Zhiyong, Wang, Junhu
• Format: Article
• Language: English
• Subjects: Graph matching; Graph theory; KBQA; Knowledge; Knowledge bases (artificial intelligence); Queries; Question answering; Questions; RDF; Semantic parsing; Semantics; SPARQL
• ISSN: 0950-7051; 1872-7409
• DOI: 10.1016/j.knosys.2021.107270

Effectiveness is essential for knowledge base question answering (KBQA) to determine whether the query can return the correct answers. Existing works for KBQA mainly focus on converting input questions into corresponding logic formats, such as SPARQL queries. However, since these works are largely decoupled from the knowledge base, the converted query may be ineffective. In this paper, we propose a novel semantic matching-based approach to model the query intention of the input question by extracting the subgraph of the knowledge base. The generation of the SPARQL query is reduced to semantic matching in the knowledge base to solve the ineffectiveness of the query. Firstly, a semantic query graph is proposed to model the reliable query intention of the input question. The SPARQL query graph could be extracted by matching the semantic query graph in the knowledge base. Secondly, an embedding-based method is developed to represent different forms of questions and queries in a common space. It is easy to detect semantic loss between the question and the converted query with the common representation. Finally, a data-driven semantic completion technique is presented to reduce the semantic loss by expanding the incomplete SPARQL query in the knowledge base. The experiments evaluated on benchmark datasets show that the proposed approach significantly outperforms state-of-the-art methods in efficiency and effectiveness. The code is available at https://github.com/offerhub-ht/gMatch.