Challenge: Recent coreference resolvers have notable improvements on the CoNLL evaluation sets, but struggle to generalize properly to new datasets.
Approach: They investigate the role of linguistic features in building more generalizable coreference resolvers . they show that employing features and subsets of their values that are informative for coreference resolution improves generalization .
Outcome: The proposed system achieves state-of-the-art results on WikiCoref, compared with a system trained on CoNLL.

Similar Papers

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.
Incorporating Centering Theory into Neural Coreference Resolution (2022.naacl-main)

Copied to clipboard

Challenge: Recent years, transformer-based coreference resolution systems have achieved remarkable improvements on the CoNLL dataset.
Approach: They propose to incorporate centering transitions derived from centering theory into a neural coreference model by using a graph.
Outcome: The proposed model improves on pronoun resolution in long documents, formal well-structured text, and clusters with scattered mentions.
Assessing the Capabilities of Large Language Models in Coreference: An Evaluation (2024.lrec-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) are a new approach to coreference resolution, but their performance is not yet fully understood.
Approach: They propose that future efforts should improve scope, data, and evaluation methods of traditional coreference research to adapt to the development of LLMs.
Outcome: The proposed methods improve scope, data, and evaluation methods of traditional coreference research to adapt to the development of LLMs.
Knowledge-aware Pronoun Coreference Resolution (P19-1)

Copied to clipboard

Challenge: Existing models for pronoun coreference resolution only use triplets, the most common format for knowledge graphs.
Approach: They propose a model that leverages different types of knowledge to resolve pronoun coreference with a neural model.
Outcome: The proposed model outperforms state-of-the-art baselines on two datasets from different domains.
Rewarding Coreference Resolvers for Being Consistent with World Knowledge (D19-1)

Copied to clipboard

Challenge: Unresolved coreference is a bottleneck for relation extraction systems . a state-of-the-art system may be able to infer the relation using distributional information about the phrase the Sunshine State, but is likely to have limited evidence for the decision that it is coreferential with Florida rather than with Skynyrd.
Approach: They propose to forward coreference input to relation extraction system and reward them for producing triples that are found in knowledge bases.
Outcome: The proposed approach improves over the state-of-the-art by forwarding their input to a relation extraction system and rewarding resolvers for producing triples that are found in knowledge bases.
LingMess: Linguistically Informed Multi Expert Scorers for Coreference Resolution (2023.eacl-main)

Copied to clipboard

Challenge: Current coreference systems use a single pairwise scoring component to assign mentions a score . different kinds of mentions require different information sources to assess their score - a problem that requires many decisions .
Approach: They propose a linguistically motivated categorization of mention-pairs into 6 types of coreference decisions and learn a dedicated scoring function for each category.
Outcome: The proposed model significantly improves the pairwise scorer and overall performance on the English Ontonotes coreference corpus and 5 additional datasets.
Improving Compositional Generalization in Classification Tasks via Structure Annotations (2021.acl-short)

Copied to clipboard

Challenge: Compositional generalization is the ability to generalize systematically to a new data distribution by combining known components.
Approach: They propose to convert a natural language sequence-to-sequence dataset into a classification dataset that requires compositional generalization.
Outcome: The proposed model can generalize compositionally by providing hints on the structure of the input.
A Context-Dependent Gated Module for Incorporating Symbolic Semantics into Event Coreference Resolution (2021.naacl-main)

Copied to clipboard

Challenge: Existing methods for event coreference resolution use symbolic features, but they are noisy and contain errors.
Approach: They propose a context-dependent gated module to adaptively control the information flows from the input symbolic features.
Outcome: The proposed model achieves state-of-the-art on two datasets: ACE 2005 and KBP 2016 .
Graph Refinement for Coreference Resolution (2022.findings-acl)

Copied to clipboard

Challenge: Existing models for coreference resolution are based on independent mention pair-wise decisions.
Approach: They propose a model that learns coreference at the document-level and takes global decisions.
Outcome: The proposed model improves over baselines, reinforcing the hypothesis that document-level information improves conference resolution.
A Systematic Assessment of Syntactic Generalization in Neural Language Models (2020.acl-main)

Copied to clipboard

Challenge: Existing work on syntactic knowledge models has not provided a clear picture of the properties required to produce proper syntaktic generalizations.
Approach: They propose to evaluate syntactic knowledge of language models by varying model architectures . they find substantial differences in syntaktic generalization performance by model architecture .
Outcome: The proposed model architectures outperform other architectures on a set of 34 English-language syntactic test suites.

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