Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Collective List-only Entity Linking: A Graph-based Approach

Version 1 : Received: 4 December 2017 / Approved: 4 December 2017 / Online: 4 December 2017 (16:01:32 CET)

How to cite: Zeng, W.; Zhao, X.; Tang, J. Collective List-only Entity Linking: A Graph-based Approach. Preprints 2017, 2017120025. Zeng, W.; Zhao, X.; Tang, J. Collective List-only Entity Linking: A Graph-based Approach. Preprints 2017, 2017120025.


List-only entity linking is the task of mapping ambiguous mentions in texts to target entities in a group of entity lists. Different from traditional entity linking task, which leverages rich semantic relatedness in knowledge bases to improve linking accuracy, list-only entity linking can merely take advantage of co-occurrences information in entity lists. State-of-the-art work utilizes co-occurrences information to enrich entity descriptions, which are further used to calculate local compatibility between mentions and entities to determine results. Nonetheless, entity coherence is also deemed to play an important part in entity linking, which is yet currently neglected. In this work, in addition to local compatibility, we take into account global coherence among entities. Specifically, we propose to harness co-occurrences in entity lists for mining both explicit and implicit entity relations. The relations are then integrated into an entity graph, on which Personalized PageRank is incorporated to compute entity coherence. The final results are derived by combining local mention-entity similarity and global entity coherence. The experimental studies validate the superiority of our method. Our proposal not only improves the performance of list-only entity linking, but also opens up the bridge between list-only entity linking and conventional entity linking solutions.


list-only entity linking; named entity disambiguation; graph-based approach


Computer Science and Mathematics, Computer Vision and Graphics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.