@inproceedings{dzendzik-etal-2020-q,
    title = "{Q}. Can Knowledge Graphs be used to Answer {B}oolean Questions? {A}. It{'}s complicated!",
    author = "Dzendzik, Daria  and
      Vogel, Carl  and
      Foster, Jennifer",
    editor = "Rogers, Anna  and
      Sedoc, Jo{\~a}o  and
      Rumshisky, Anna",
    booktitle = "Proceedings of the First Workshop on Insights from Negative Results in NLP",
    month = nov,
    year = "2020",
    address = "Online",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/2020.insights-1.2",
    doi = "10.18653/v1/2020.insights-1.2",
    pages = "6--14",
    abstract = "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.",
}