An Online Question Answering System based on Sub-graph Searching
Not on the map. Why?
Abstract (arXiv)
Knowledge graphs (KGs) have been widely used for question answering (QA) applications, especially the entity based QA. However, searching an-swers from an entire large-scale knowledge graph is very time-consuming and it is hard to meet the speed need of real online QA systems. In this pa-per, we design a sub-graph searching mechanism to solve this problem by creating sub-graph index, and each answer generation step is restricted in the sub-graph level. We use this mechanism into a real online QA chat system, and it can bring obvious improvement on question coverage by well answer-ing entity based questions, and it can be with a very high speed, which en-sures the user experience of online QA.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 5 references that are in the map. First posted on arXiv 29 Jul 2021.
Builds on
4 of 5 references.
References · 4
- 2019PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Textcited by 184
- 2018Open Domain Question Answering Using Early Fusion of Knowledge Bases and Textcited by 168
- 2018EARL: Joint Entity and Relation Linking for Question Answering over Knowledge Graphscited by 20
- 2020TCNN: Triple Convolutional Neural Network Models for Retrieval-based Question Answering System in E-commercecited by 3
Built on by
Not cited yet.