3260 papers • 126 benchmarks • 313 datasets
Entity Disambiguation is the task of linking mentions of ambiguous entities to their referent entities in a knowledge base such as Wikipedia. Source: Leveraging Deep Neural Networks and Knowledge Graphs for Entity Disambiguation
(Image credit: Papersgraph)
These leaderboards are used to track progress in entity-disambiguation-2
Use these libraries to find entity-disambiguation-2 models and implementations
No subtasks available.
A novel deep learning model for joint document-level entity disambiguation is proposed, which leverages learned neural representations and combines benefits of deep learning with more traditional approaches such as graphical models and probabilistic mention-entity maps.
This work proposes EntEval: a test suite of diverse tasks that require nontrivial understanding of entities including entity typing, entity similarity, entity relation prediction, and entity disambiguation, and develops training techniques for learning better entity representations by using natural hyperlink annotations in Wikipedia.
A simple yet effective solution, called Dynamic Context Augmentation (DCA), for collective EL, which requires only one pass through the mentions in a document, and can cope with different local EL models as a plug-and-enhance module.
Entities are at the center of how we represent and aggregate knowledge. For instance, Encyclopedias such as Wikipedia are structured by entities (e.g., one per article). The ability to retrieve such entities given a query is fundamental for knowledge-intensive tasks such as entity linking and open-domain question answering. One way to understand current approaches is as classifiers among atomic labels, one for each entity. Their weight vectors are dense entity representations produced by encoding entity information such as descriptions. This approach leads to several shortcomings: i) context and entity affinity is mainly captured through a vector dot product, potentially missing fine-grained interactions between the two; ii) a large memory footprint is needed to store dense representations when considering large entity sets; iii) an appropriately hard set of negative data has to be subsampled at training time. We propose GENRE, the first system that retrieves entities by generating their unique names, left to right, token-by-token in an autoregressive fashion, and conditioned on the context. This enables to mitigate the aforementioned technical issues: i) the autoregressive formulation allows us to directly capture relations between context and entity name, effectively cross encoding both; ii) the memory footprint is greatly reduced because the parameters of our encoder-decoder architecture scale with vocabulary size, not entity count; iii) the exact softmax loss can be efficiently computed without the need to subsample negative data. We show the efficacy of the approach with more than 20 datasets on entity disambiguation, end-to-end entity linking and document retrieval tasks, achieving new SOTA, or very competitive results while using a tiny fraction of the memory of competing systems. Finally, we demonstrate that new entities can be added by simply specifying their unambiguous name.
This paper creates a new entity type system and training set from a large corpus of biomedical texts by mapping entities to concepts in a medical ontology, and from this mapping they derive Biomedical Interpretable Entity Representations, in which dimensions correspond to fine-grained entity types, and values are predicted probabilities that a given entity is of the corresponding type.
ReFinED is introduced, an efficient end-to-end entity linking model which uses fine-grained entity types and entity descriptions to perform linking and is an effective and cost-efficient system for extracting entities from web-scale datasets.
This work introduces an ED model which links entities by reasoning over a symbolic knowledge base in a fully differentiable fashion, and surpasses state-of-the-art baselines on six well-established ED datasets by 1.3 F1 on average.
It is demonstrated that formal grammars can describe the output space for a much wider range of tasks and argued that GCD can serve as a unified framework for structured NLP tasks in general.
The different types of links in Wikipedia are studied, and it is shown that using the full graph is more effective than just direct links by a large margin, that non-reciprocal links harm performance, and that there is no benefit from categories and infoboxes.
Adding a benchmark result helps the community track progress.