Knowledge base question answering via path matching

Knowledge base question answering (KBQA) refers to combining the information in the knowledge base to obtain an answer for an objective question. However, most of the existing methods tend to add a large number of hand-crafted features or constraints to improve the performance of the model. This makes the KBQA system more and more complex, but the improvement is limited. In this work, we try a novel method without any hand-crafted features or constraints, which transforms this problem into a text matching problem. In this method, a question and a series of edges in knowledge bases (KBs) are treated as two pieces of text that need to be matched. The network to match the two texts called Path Matching Model (PMM). On the WebQuestions benchmark, our method has 3% improvement compared to the state-of-the-art method.(c) 2022 Published by Elsevier B.V.