Open Domain Question Answering Using Early Fusion of Knowledge Bases and Text
About
Open Domain Question Answering (QA) is evolving from complex pipelined systems to end-to-end deep neural networks. Specialized neural models have been developed for extracting answers from either text alone or Knowledge Bases (KBs) alone. In this paper we look at a more practical setting, namely QA over the combination of a KB and entity-linked text, which is appropriate when an incomplete KB is available with a large text corpus. Building on recent advances in graph representation learning we propose a novel model, GRAFT-Net, for extracting answers from a question-specific subgraph containing text and KB entities and relations. We construct a suite of benchmark tasks for this problem, varying the difficulty of questions, the amount of training data, and KB completeness. We show that GRAFT-Net is competitive with the state-of-the-art when tested using either KBs or text alone, and vastly outperforms existing methods in the combined setting. Source code is available at https://github.com/OceanskySun/GraftNet .
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Knowledge Base Question Answering | WEBQSP (test) | Hit@169.5 | 143 | |
| Knowledge Graph Question Answering | WebQSP | Hit@167.8 | 122 | |
| Knowledge Graph Question Answering | CWQ | Hit@136.8 | 105 | |
| Knowledge Graph Question Answering | CWQ (test) | Hits@136.8 | 69 | |
| Knowledge Base Question Answering | WebQSP Freebase (test) | F1 Score62.8 | 46 | |
| Knowledge Base Question Answering | CWQ (test) | F1 Score32.7 | 42 | |
| Temporal Knowledge Graph Question Answering | TimeQuestions (test) | Hits@1 (Overall)45.2 | 38 | |
| Question Answering | MetaQA 3-hop | Hits@177.7 | 38 | |
| Knowledge Base Question Answering | MetaQA 1hop | Hits@197 | 28 | |
| Knowledge Graph Question Answering | ComplexWebQuestions (CWQ) 1.1 (test) | Hit@10.368 | 25 |