Joint Entity and Relation Linking for Question Answering over Knowledge Graphs

EARL (Entity And Relation Linker), a system for jointly linking entities and relations in a question to a knowledge graph. EARL treats entity linking and relation linking as a single task and thus aims to reduce the error caused by the dependent steps. To realise this, EARL uses the knowledge graph to jointly disambiguate entity and relations. EARL obtains the context for entity disambiguation by observing the relations surrounding the entity. Similarly, it obtains the context for relation disambiguation by looking at the surrounding entities. We support multiple entities and relations occurring in complex questions by modeling the joint entity and relation linking task as an instance of the Generalised Travelling Salesman Problem (GTSP).

Project Team: