Strong Baselines For Simple Question Answering Over Knowledge Graphs With And Without Neural Networks | Awesome LLM Papers Contribute to Awesome LLM Papers

Strong Baselines For Simple Question Answering Over Knowledge Graphs With And Without Neural Networks

Salman Mohammed, Peng Shi, Jimmy Lin . Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers) 2018 – 111 citations

[Paper]   Search on Google Scholar   Search on Semantic Scholar
ACL Datasets NAACL

We examine the problem of question answering over knowledge graphs, focusing on simple questions that can be answered by the lookup of a single fact. Adopting a straightforward decomposition of the problem into entity detection, entity linking, relation prediction, and evidence combination, we explore simple yet strong baselines. On the popular SimpleQuestions dataset, we find that basic LSTMs and GRUs plus a few heuristics yield accuracies that approach the state of the art, and techniques that do not use neural networks also perform reasonably well. These results show that gains from sophisticated deep learning techniques proposed in the literature are quite modest and that some previous models exhibit unnecessary complexity.

Similar Work