Pair-Linking for Collective Entity Disambiguation: Two Could Be Better Than All
Collective entity disambiguation aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base. Previous works are primarily based on the underlying assumption that entities within the same document are highly related. However, the extend to which these mentioned entities are actually connected in reality is rarely studied and therefore raises interesting research questions. For the first time, we show that the semantic relationships between the mentioned entities are in fact less dense than expected. This could be attributed to several reasons such as noise, data sparsity and knowledge base incompleteness. As a remedy, we introduce MINTREE, a new tree-based objective for the entity disambiguation problem. The key intuition behind MINTREE is the concept of coherence relaxation which utilizes the weight of a minimum spanning tree to measure the coherence between entities. Based on this new objective, we design a novel entity disambiguation algorithms which we call Pair-Linking. Instead of considering all the given mentions, Pair-Linking iteratively selects a pair with the highest confidence at each step for decision making. Via extensive experiments, we show that our approach is not only more accurate but also surprisingly faster than many state-of-the-art collective linking algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
AllDecision MakingEntity DisambiguationSimilar Papers 제목 키워드 기반
A Sequence Learning Method for Domain-Specific Entity Linking
Recent collective Entity Linking studies usually promote global coherence of all the mapped entities in the same document by using semantic embeddings and graph-based approaches. Although graph-based approaches are shown…
Entity DisambiguationEntity LinkingKnowledge Graph CompletionLink Prediction+2End-to-End Entity Linking and Disambiguation leveraging Word and Knowledge Graph Embeddings
Entity linking - connecting entity mentions in a natural language utterance to knowledge graph (KG) entities is a crucial step for question answering over KGs. It is often based on measuring the string similarity between…
Entity DisambiguationEntity LinkingKnowledge Graph EmbeddingsQuestion Answering+3LATTE: Latent Type Modeling for Biomedical Entity Linking
Entity linking is the task of linking mentions of named entities in natural language text, to entities in a curated knowledge-base. This is of significant importance in the biomedical domain, where it could be used to se…
Entity DisambiguationEntity LinkingVocal Bursts Type PredictionEntity Disambiguation via Fusion Entity Decoding
Entity disambiguation (ED), which links the mentions of ambiguous entities to their referent entities in a knowledge base, serves as a core component in entity linking (EL). Existing generative approaches demonstrate imp…
DecoderEntity DisambiguationEntity LinkingRetrievalNeural Collective Entity Linking Based on Recurrent Random Walk Network Learning
Benefiting from the excellent ability of neural networks on learning semantic representations, existing studies for entity linking (EL) have resorted to neural networks to exploit both the local mention-to-entity compati…
Entity DisambiguationEntity LinkingLearning Semantic Representations