Q. Can knowledge graphs be used to answer Boolean questions?
A. It’s complicated!
Dzendzik, Daria, Vogel, CarlORCID: 0000-0001-8928-8546 and Foster, JenniferORCID: 0000-0002-7789-4853
(2020)
Q. Can knowledge graphs be used to answer Boolean questions?
A. It’s complicated!
In: First Workshop on Insights from Negative Results in NLP, 10 Nov 2020, Online.
In this paper we explore the problem of machine reading comprehension, focusing on the BoolQ dataset of Yes/No questions. We carry out an error analysis of a BERT-based machine reading comprehension model on this dataset, revealing issues such as unstable model behaviour and some noise within the dataset itself. We then experiment with two approaches
for integrating information from knowledge graphs: (i) concatenating knowledge graph triples to text passages and (ii) encoding
knowledge with a Graph Neural Network. Neither of these approaches show a clear improvement and we hypothesize that this may be due
to a combination of inaccuracies in the knowledge graph, imprecision in entity linking, and the models’ inability to capture additional information from knowledge graphs.
Science Foundation Ireland in the ADAPT Centre for Digital Content Technology, funded under the SFI Research Centres Programme (Grant 13/RC/2106) and the European Regional Development Fund.
ID Code:
25960
Deposited On:
03 Jun 2021 11:09 by
Jennifer Foster
. Last Modified 03 Jun 2021 11:09