Paper 79 (Research track)

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

Author(s): Mohnish Dubey, Debayan Banerjee, Debanjan Chaudhuri, Jens Lehmann

Abstract: In order to answer natural language questions over knowledge graphs, most processing pipelines involve entity and relation linking. Traditionally, entity linking and relation linking has been performed either as dependent sequential tasks or independent parallel tasks. In this paper, we propose a framework, called EARL, which performs entity linking and relation linking as a joint single task. We model the linking task as an instance of the Generalised Travelling Salesman problem (GTSP). EARL uses a graph connection based solution to the problem. The system determines the best semantic connection between all keywords of
the question by referring to the knowledge graph. This is achieved by exploiting the connection density between entity candidates and relation candidates. The Connection-Density based solution performs at par with GTSP solution and approximate GTSP solution. We have empirically evaluated the framework on a dataset with 5000 questions. Our system surpasses state-of-the-art scores for entity linking task by reporting an accuracy of 0.65 to 0.40 from the next best entity linker.

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

One thought to “Paper 79 (Research track)”

  1. I did like the approach and the evaluation.
    It looks particularly familiar 8-).
    I have just one question, why did the author did not mention, nor evaluate its approach with a very similar work that investigates the same research questions, but published in 2016 [1][2].

    [1] https://www.researchgate.net/publication/309700280_Exploring_Term_Networks_for_Semantic_Search_over_RDF_Knowledge_Graphs
    [2] https://www.researchgate.net/publication/321385555_Exploring_Term_Networks_for_Semantic_Search_over_Large_RDF_Knowledge_Graphs

Leave a Reply

Your email address will not be published. Required fields are marked *