Challenge: Unlike singular mentions each of which represents one entity, plural mentions stand for multiple entities.
Approach: They propose a novel coreference resolution algorithm that selectively creates clusters to handle both singular and plural mentions and a deep learning-based entity linking model that jointly handles both types of mentions through multi-task learning.
Outcome: The proposed model outperforms existing models designed for singular mentions and plural mentions.

Similar Papers

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 .
Joint Coreference Resolution and Character Linking for Multiparty Conversation (2021.eacl-main)

Copied to clipboard

Challenge: Character linking is the task of linking mentioned people in conversations to the real world . human use of pronouns or normal entities makes it difficult to link mentioned people to real people . a critical step towards understanding conversations is grounding mentioned people - a goal of the natural language processing community .
Approach: They propose to integrate richer context from the coreference relations among different mentions to help the linking task.
Outcome: The proposed model outperforms all previous models on both tasks.
Bridging Resolution: A Survey of the State of the Art (2020.coling-main)

Copied to clipboard

Challenge: bridging resolution is an anaphora resolution task that is less studied than entity coreference resolution.
Approach: This paper presents a survey of the current state of research on bridging resolution . it identifies and resolves bridling/associative anaphors, which are anamorphic references to non-identical associated antecedents.
Outcome: The proposed task is more difficult than entity coreference resolution because of the lack of annotated corpora and lack of standardized evaluation protocols.
Major Entity Identification: A Generalizable Alternative to Coreference Resolution (2024.emnlp-main)

Copied to clipboard

Challenge: Prior work identified annotation differences as one of the main reasons for the limited generalization gap in coreference resolution models.
Approach: They propose an alternative referential task where the target entities are assumed to be specified in the input and the task is limited to the frequent entities.
Outcome: The proposed model generalizes well across domains on multiple datasets with supervised models and LLM-based few-shot prompting.
Active Learning for Coreference Resolution using Discrete Annotation (2020.acl-main)

Copied to clipboard

Challenge: Exhaustively annotating coreference is expensive as it requires tracking coreference chains across long passages of text.
Approach: They propose a pairwise annotation technique which asks annotators to identify mention antecedents if a presented mention pair is not coreferent.
Outcome: The proposed method is much more efficient when combined with a mention clustering algorithm for selecting which examples to label . future work can use the proposed protocol to develop coreference models for new domains.
Revisiting Joint Modeling of Cross-document Entity and Event Coreference Resolution (P19-1)

Copied to clipboard

Challenge: Recognizing that various textual spans across multiple texts refer to the same entity or event is an important NLP task.
Approach: They propose a neural architecture for cross-document coreference resolution by representing an event mention using its lexical span, surrounding context, and relation to other mentions via predicate-arguments structures.
Outcome: The proposed model outperforms the state-of-the-art event coreference model on ECB+ while providing the first entity coreference results on this corpus.
Conundrums in Entity Coreference Resolution: Making Sense of the State of the Art (2020.emnlp-main)

Copied to clipboard

Challenge: despite significant progress on entity coreference resolution, there is a general lack of understanding of what has been improved.
Approach: They present an empirical analysis of entity coreference resolvers to provide an understanding of what has been improved.
Outcome: The proposed model improves the performance of entity coreference resolvers.
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.
Neural Coreference Resolution with Deep Biaffine Attention by Joint Mention Detection and Mention Clustering (P18-2)

Copied to clipboard

Challenge: Existing methods for identifying and clustering mentions in text are complex and require heuristics to solve.
Approach: They propose to use a biaffine attention model to get antecedent scores for each possible mention and optimize mention detection and mention clustering accuracy given the mention cluster labels.
Outcome: The proposed model achieves the state-of-the-art performance on the CoNLL-2012 shared task English test set.
Improving Entity Linking by Modeling Latent Relations between Mentions (P18-1)

Copied to clipboard

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.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations