The entity linking task consists in automatically identifying and linking the entities mentioned in a text to their uniform resource identifiers in a given knowledge base. This task is very challenging due to its natural language ambiguity. However, not all the entities mentioned in the document have the same utility in understanding the topics being discussed. Thus, the related problem of identifying the most relevant entities present in the document, also known as salient entities (SE), is attracting increasing interest. In this paper, we propose salient entity linking, a novel supervised 2-step algorithm comprehensively addressing both entity linking and saliency detection. The first step is aimed at identifying a set of candidate entities that are likely to be mentioned in the document. The second step, besides detecting linked entities, also scores them according to their saliency. Experiments conducted on 2 different data sets show that the proposed algorithm outperforms state-of-the-art competitors and is able to detect SE with high accuracy. Furthermore, we used salient entity linking for extractive text summarization. We found that entity saliency can be incorporated into text summarizers to extract salient sentences from text. The resulting summarizers outperform well-known summarization systems, proving the importance of using the SE information.
|Titolo:||SEL: A unified algorithm for salient entity linking|
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||2.1 Articolo su rivista |
File in questo prodotto:
|paper-final-version.pdf||Versione dell'editore||Accesso chiuso-personale||Riservato|
|SEL__a_Unified_Algorithm_for_Entity_Linking_and_Saliency_Detection.pdf||post-print (Editore Wiley: yellow access con 12 mesi di embargo)||Documento in Post-print||Accesso libero (no vincoli)||Open Access Visualizza/Apri|