Challenge: Coreference resolution is a challenging task in Natural Language Processing . since a few years, the biggest step forward has been made using deep neural networks .
Approach: They propose to improve coreference resolution by adding semantic features to a top-level deep neural network system . they evaluate a shared task dataset and compare it to the state-of-the-art system based on Stanford deep-coref .
Outcome: The proposed system achieves 1.13% gain over the CoNLL 2012 dataset and the state-of-the-art system.

Similar Papers

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.
Triad-based Neural Network for Coreference Resolution (C18-1)

Copied to clipboard

Challenge: Entity coreference resolution aims to identify mentions that refer to the same entity.
Approach: They propose a triad-based neural network system that generates affinity scores between entity mentions for coreference resolution.
Outcome: The proposed system generates affinity scores between mentions for coreference resolution.
Coreference Resolution through a seq2seq Transition-Based System (2023.tacl-1)

Copied to clipboard

Challenge: Recent coreference resolution systems use search algorithms to identify mentions and resolve coreference.
Approach: They propose a text-to-text coreference resolution system that uses a semantic paradigm to predict mentions and links jointly.
Outcome: The proposed system achieves state-of-the-art accuracy on CoNLL-2012 datasets with 83.3 F1-score for English, 68.5 F1 score for Arabic, and 74.3 F1 scores for Chinese.
Deep Neural Networks for Coreference Resolution for Polish (L18-1)

Copied to clipboard

Challenge: Existing deep neural networks for coreference resolution for Polish have been used to resolve textual fragments that refer to the same entity in the discourse world.
Approach: They propose a system combining the best deep neural architecture and sieve-based coreference resolvers ordered from most to least precise to achieve the highest results.
Outcome: The proposed system improves the state of the art for Polish by 0.53 F1 points, reaching 81.23 points of the CoNLL metric.
ImCoref-CeS: An Improved Lightweight Pipeline for Coreference Resolution with LLM-based Checker-Splitter Refinement (2026.acl-long)

Copied to clipboard

Challenge: Existing supervised neural methods for coreference resolution are underexplored . current methods rely on small language models, but their potential is underexploited .
Approach: They propose a framework that integrates an enhanced supervised model with LLM-based reasoning.
Outcome: The proposed method surpasses existing state-of-the-art methods in coreference resolution.
Sentence-Incremental Neural Coreference Resolution (2022.emnlp-main)

Copied to clipboard

Challenge: Existing systems for identifying spans as mentions are based on mention-pair formulations, but they are not generalized beyond pronouns.
Approach: They propose a sentence-incremental neural coreference resolution system which incrementally builds clusters after marking mention boundaries in a shift-reduce method.
Outcome: The proposed system outperforms state-of-the-art methods on OntoNotes and CODI-CRAC 2021 datasets and is comparable to state- of-the art methods.
Interpretable Coreference Resolution Evaluation Using Explicit Semantics (2026.acl-long)

Copied to clipboard

Challenge: Existing evaluation methods for coreference resolution are limited by semantic and contextual information.
Approach: They propose a semantically-enhanced evaluation framework for coreference resolution that assigns semantic labels to nominal mentions and propagates them to entire coreference clusters.
Outcome: The proposed framework uncovers systematic weaknesses obscured by standard metrics.
Multitask Learning-Based Neural Bridging Reference Resolution (2020.coling-main)

Copied to clipboard

Challenge: Existing models for bridging references lack large corpora annotated with briding references . second challenge is different definitions of bridding used in different corpors .
Approach: They propose a multi-task learning-based neural model for bridging reference resolution . they show substantial improvements of up to 8 p.p. on full briding resolution compared to previous models .
Outcome: The proposed model outperforms the best reported results on full bridging resolution by up to 8 p.p.
End-to-End Neural Discourse Deixis Resolution in Dialogue (2022.emnlp-main)

Copied to clipboard

Challenge: Lexical overlap is a strong indicator of entity coreference, both among names and in the resolution of nominals.
Approach: They propose to extend their span-based entity coreference model to exploit task-specific characteristics of discourse deixis resolution in dialogue.
Outcome: The proposed model achieves state-of-the-art results on the four datasets in the CODI-CRAC 2021 shared task.
Exploiting Document Structures and Cluster Consistencies for Event Coreference Resolution (2021.acl-long)

Copied to clipboard

Challenge: Existing deep learning models for event coreference resolution are limited in that they cannot exploit important interactions between relevant objects for ECR.
Approach: They propose a deep learning model that groups coreferent event mentions into the same clusters . they use document structures to capture relevant objects for ECR .
Outcome: The proposed model achieves state-of-the-art on two benchmark datasets.

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