EARL: Joint Entity and Relation Linking for Question Answering over Knowledge Graphs

Merrill Hall October 10, 2018 11:00 - 11:20

Bookmark and Share

Mohnish Dubey, Debayan Banerjee, Debanjan Chaudhuri and Jens Lehmann.  

Abstract:  Many question answering systems over knowledge graphs rely on entity and relation linking components in order to connect the natural language input to the underlying knowledge graph. Traditionally, entity linking and relation linking has been performed either as a dependent, sequential tasks or as independent, parallel tasks. In this paper, we propose a framework called EARL, which performs entity linking and relation linking as a joint task. EARL implements two different solution strategies for which we provide a comparative analysis in this paper: The first strategy is a formalization of the joint entity and relation linking tasks as an instance of the Generalised Travelling Salesman Problem (GTSP). In order to be computationally feasible, we employ approximate GTSP solvers. The second strategy uses machine learning in order to exploit the connection density between nodes in the knowledge graph. It relies on three base features and re-ranking steps in order to predict entities and relations. We compare the strategies and evaluate them on a dataset with 5000 questions. Both strategies significantly outperform the current state-of-the-art approaches for entity and relation linking.

Keywords:  Entity Linking;  Relation Linking;  Generalised Travelling Salesman Problem;  Question Answering