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. Preprints2017, 2017120025. https://doi.org/10.20944/preprints201712.0025.v1.
Zeng, W.; Zhao, X.; Tang, J. Collective List-only Entity Linking: A Graph-based Approach. Preprints 2017, 2017120025. https://doi.org/10.20944/preprints201712.0025.v1.
Cite as:
Zeng, W.; Zhao, X.; Tang, J. Collective List-only Entity Linking: A Graph-based Approach. Preprints2017, 2017120025. https://doi.org/10.20944/preprints201712.0025.v1.
Zeng, W.; Zhao, X.; Tang, J. Collective List-only Entity Linking: A Graph-based Approach. Preprints 2017, 2017120025. https://doi.org/10.20944/preprints201712.0025.v1.
Abstract
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.
Keywords
list-only entity linking; named entity disambiguation; graph-based approach
Subject
MATHEMATICS & COMPUTER SCIENCE, Other
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.