| Challenge: | Entity linking systems often exploit relations between textual mentions to decide if the linking decisions are compatible. |
| Approach: | They treat relations as latent variables while optimizing the neural entity-linking model without supervision. |
| Outcome: | The proposed model outperforms its relation-agnostic version and significantly outperformed its relational version. |
Similar Papers
Contextual Augmentation for Entity Linking using Large Language Models (2025.coling-main)
Copied to clipboard
| Challenge: | Entity Linking involves detecting and linking entity mentions in natural language texts to a knowledge graph. |
| Approach: | They propose a fine-tuned model that integrates entity recognition and disambiguation in a unified framework. |
| Outcome: | The proposed model achieves state-of-the-art on out-of domain datasets and compares with baselines. |
Boosting Entity Linking Performance by Leveraging Unlabeled Documents (P19-1)
Copied to clipboard
| Challenge: | a new approach to entity linking relies on unlabeled documents and Wikipedia . a supervised approach uses only natural information, such as unlabed documents . |
| Approach: | They propose a method which exploits only naturally occurring information . they construct a high recall list of candidate entities for each mention in an unlabeled document . |
| Outcome: | The proposed model outperforms fully-supervised state-of-the-art systems on standard test sets. |
Towards Consistent Document-level Entity Linking: Joint Models for Entity Linking and Coreference Resolution (2022.acl-short)
Copied to clipboard
| Challenge: | Existing approaches to solve entity linking (EL) jointly with coreference resolution (coref) a coreferenced cluster can only be linked to a single entity or NIL (i.e., a nonlinkable entity) |
| Approach: | They propose to join entity linking and coreference resolution in a single structured prediction task over directed trees and use a globally normalized model to solve it. |
| Outcome: | The proposed model improves on two datasets with a +5% boost in accuracy compared to standalone models . the proposed model is based on current models that predict a single antecedent for each span to resolve . |
Entity Linking via Explicit Mention-Mention Coreference Modeling (2022.naacl-main)
Copied to clipboard
| Challenge: | Using a learning approach for entity mentions is a key component of modern entity linking systems for both candidate generation and making linking predictions. |
| Approach: | They propose a training approach that builds minimum spanning arborescences over mentions and entities to explicitly model mention coreference relationships. |
| Outcome: | The proposed approach improves candidate generation recall and link accuracy on the biomedical dataset and on MedMentions, setting a new SOTA result in linking accuracy. |
MOLEMAN: Mention-Only Linking of Entities with a Mention Annotation Network (2021.acl-short)
Copied to clipboard
| Challenge: | Existing approaches to entity linking represent each entity with a single vector, but instead use a contextualized mention-encoder that learns to place similar mentions of the same entity closer in vector space than mentions from different entities. |
| Approach: | They propose an instance-based nearest neighbor approach to entity linking that allows for a contextualized mention-encoder to learn to place similar mentions of the same entity closer in vector space than mentions from different entities. |
| Outcome: | The proposed approach outperforms all other systems on two multilingual benchmarks and is simpler to train and interpretable. |
Improving Fine-grained Entity Typing with Entity Linking (D19-1)
Copied to clipboard
| Challenge: | Existing methods for fine-grained entity typing require a large tag set and knowledge of the context. |
| Approach: | They propose a deep neural model that uses context and information from entity linking to improve fine-grained entity typing. |
| Outcome: | The proposed model achieves 5% absolute strict accuracy improvement over the state of the art on two datasets. |
Effective Use of Context in Noisy Entity Linking (D18-1)
Copied to clipboard
| Challenge: | Effectively using an entity mention's context to disambiguate it is the crux of the entity linking task. |
| Approach: | They propose to use convolutional neural networks to extract cues from context to effectively disambiguate between closely related concepts. |
| Outcome: | The proposed model outperforms previous work on the WikilinksNED test set by 2.8% absolute. |
Fine-Grained Evaluation for Entity Linking (D19-1)
Copied to clipboard
| Challenge: | Entity Linking (EL) is an Information Extraction task that identifies entity mentions in a text corpus and associates them with an unambiguous identifier in KBs such as Wikipedia, BabelNet, DBpedia, Wikidata and YAGO. |
| Approach: | They propose a fine-grained categorization of different types of entity mentions and links and propose 'fuzzy recall' metric to address the lack of consensus and compare a selection of online EL systems. |
| Outcome: | The proposed task offers a bridge between unstructured text and structured KBs, where EL has applications for semantic search, document classification, relation extraction, and more. |
Contextualized End-to-End Neural Entity Linking (2020.aacl-main)
Copied to clipboard
| Challenge: | a proposed entity linking model that disjointly applies MD and ED from the same contextualized BERT embeddings is able to generalize better. |
| Approach: | They propose an entity linking (EL) model that jointly learns mention detection (MD) and entity disambiguation (ED) they propose to use task-specific heads on top of shared BERT contextualized embeddings to learn MD and ED. |
| Outcome: | The proposed model achieves state-of-the-art results across a standard EL dataset and under a setting where hand-crafted candidate sets are not available. |
Distant Learning for Entity Linking with Automatic Noise Detection (P19-1)
Copied to clipboard
| Challenge: | Accurate entity linkers have been produced for domains and languages where no or very limited amounts of labeled data are available. |
| Approach: | They propose to use annotated text to learn to link entities without labeling . they frame the task as a multi-instance learning problem and rely on surface matching to create initial noisy labels. |
| Outcome: | The proposed method outperforms the baseline surface matching model for a subset of entities. |