| Challenge: | Existing models for entity disambiguation combine local contextual information and global evidences. |
| Approach: | They propose a limited discrepancy search model that combines local contextual information and global evidences to improve a local solution from a global view point. |
| Outcome: | The proposed model improves local and global solutions on CoNLL 2003 and TAC 2010 benchmarks. |
Similar Papers
Entity Disambiguation on a Tight Labeling Budget (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to training entity disambiguation models require a small labeling budget . a defense research analyst might need to map military equipment to a knowledge base describing emergent defense technologies. |
| Approach: | They propose a method that combines feature diversity with low rank correction . they use bilinear tensor models to train a model that uses a rich representation of context . |
| Outcome: | The proposed approach reduces the amount of labeled data necessary to achieve a given performance. |
Global Entity Disambiguation with BERT (2022.naacl-main)
Copied to clipboard
| Challenge: | Entity disambiguation (ED) is a task of assigning mentions to referent entities in a knowledge base. |
| Approach: | They propose a global entity disambiguation (ED) model based on BERT . they train the model using a large entity-annotated corpus obtained from Wikipedia . |
| Outcome: | The proposed model can disambiguate masked entities based on words and non-masked ones at the inference time. |
Learning from Noisy Labels for Entity-Centric Information Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent information extraction approaches can easily overfit noisy labels and suffer from performance degradation. |
| Approach: | They propose a co-regularization framework for entity-centric information extraction that optimizes neural models with task-specific losses and regularizes them to generate similar predictions based on agreement loss. |
| Outcome: | The proposed framework is optimized with task-specific losses and generates similar predictions based on agreement loss. |
Unsupervised Named Entity Disambiguation for Low Resource Domains (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to Named Entity Disambiguation (NED) are inefficient for domain specific tasks such as searching, question answering and information extraction. |
| Approach: | They propose a unsupervised approach leveraging the concept of Group Steiner Trees which can identify the most relevant candidate for entity disambiguation using contextual similarities across candidate entities for all the mentions present in a document. |
| Outcome: | The proposed approach outperforms the state-of-the-art methods by more than 40% in terms of Precision@1 and Hit@5 across various domain-specific datasets. |
Global-to-Local Neural Networks for Document-Level Relation Extraction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Relation extraction (RE) aims to identify the semantic relations between named entities in text. |
| Approach: | They propose a novel relation extraction model that encodes document information in terms of entity global and local representations and context relation representations. |
| Outcome: | The proposed model achieves superior performance on two public datasets for document-level RE. |
Entity Disambiguation with Entity Definitions (2023.eacl-main)
Copied to clipboard
| Challenge: | Entity Disambiguation (ED) is a crucial problem in Natural Language Processing (NLP). |
| Approach: | They propose to use Wikipedia titles as the textual representation of each candidate to improve the generalization capability over unseen patterns. |
| Outcome: | The proposed model improves on 2 out of 6 benchmarks and is generalized over unseen patterns. |
Improving Entity Disambiguation by Reasoning over a Knowledge Base (2022.naacl-main)
Copied to clipboard
| Challenge: | Recent work in entity disambiguation relies on a limited subset of KB facts to link entities . less common entities are prone to missing or inconsistent KB information, which is problematic for models which rely on 'one source' |
| Approach: | They propose an ED model which links entities by reasoning over a symbolic knowledge base in a fully differentiable fashion. |
| Outcome: | The proposed model outperforms state-of-the-art models on six well-established datasets by 1.3 F1 on average. |
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. |
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. |
ExtEnD: Extractive Entity Disambiguation (2022.acl-long)
Copied to clipboard
| Challenge: | Entity disambiguation (ED) is a task in natural language processing that requires a large pre-trained language model to perform. |
| Approach: | They propose a local formulation for Entity Disambiguation (ED) that frames this task as a text extraction problem and propose two Transformer-based architectures that implement it. |
| Outcome: | The proposed model outperforms all its competitors in terms of data efficiency and raw performance on 4 out of 4 benchmarks. |