Using Automatically Extracted Minimum Spans to Disentangle Coreference Evaluation from Boundary Detection (P19-1)
Copied to clipboard
| Challenge: | Existing methods to evaluate maximum spans tangle coreference evaluation with mention boundary detection . however, this method is costly and does not scale to large corpora. |
| Approach: | They propose an algorithm for automatically extracting minimum spans to benefit from minimum span evaluation in all corpora. |
| Outcome: | The proposed algorithm is consistent with those manually annotated by experts. |
Similar Papers
CorefQA: Coreference Resolution as Query-based Span Prediction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing coreference resolution models suffer from mention proposal. |
| Approach: | They propose a query-based span prediction task that can retrieve mentions left out at the mention proposal stage. |
| Outcome: | The proposed model can retrieve mentions left out at the mention proposal stage and improve generalization capability using existing question answering datasets. |
Span-Level Model for Relation Extraction (P19-1)
Copied to clipboard
| Challenge: | Recent approaches for this span-level task have inherent limitations. |
| Approach: | They propose a model which directly models all possible spans and performs joint entity mention detection and relation extraction. |
| Outcome: | The proposed model performs joint entity mention detection and relation extraction on the ACE2005 dataset. |
Z-coref: Thai Coreference and Zero Pronoun Resolution (2024.acl-srw)
Copied to clipboard
| Challenge: | limited research and datasets pose significant challenges in Thai language . a proposed model capable of simultaneously handling CR and ZPR tasks takes less time to train . |
| Approach: | They propose to annotate a Thai-based CR and ZPR dataset and introduce a model that can handle both tasks by adjusting the span definition to include token gaps. |
| Outcome: | The proposed model outperforms the state-of-the-art in resolving both coreference resolution and zero-pronoun resolution while taking less time to train. |
Do UD Trees Match Mention Spans in Coreference Annotations? (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to annotate mention spans are based on delimiting token intervals, but there is no syntactic representation of the mention span. |
| Approach: | They propose to integrate coreference annotation with syntactic annotation to make them convergent in the long term. |
| Outcome: | The proposed approach could be advantageous in the long term, the authors argue. |
Word-Level Coreference Resolution (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent coreference resolution models rely heavily on span representations to find coreference links between word spans. |
| Approach: | They propose to consider coreference links between individual words rather than word spans and reconstruct the word span. |
| Outcome: | The proposed model outperforms existing models on the OntoNotes benchmark while being highly efficient. |
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. |
Coreference Resolution in Full Text Articles with BERT and Syntax-based Mention Filtering (D19-57)
Copied to clipboard
| Challenge: | Existing systems for coreference resolution are difficult because of their long coreferent chains. |
| Approach: | They propose to use an existing span-based neural coreference resolution system as a baseline . they filter noisy mentions based on parse trees and integrate a highly expressive language model into the system . |
| Outcome: | The proposed system outperforms the baseline system on the CRAFT Shared Tasks 2019 task. |
Annotating Mentions Alone Enables Efficient Domain Adaptation for Coreference Resolution (2023.acl-long)
Copied to clipboard
| Challenge: | Recent results show that annotating mentions is twice as fast as annotation of full coreference chains. |
| Approach: | They propose a method for efficiently adapting coreference models using only mentions in the target domain without increasing annotator time. |
| Outcome: | The proposed method improves average F1 without increasing annotator time. |
Semantic Span Annotation: An Exploratory Study of LLM Annotation (2026.acl-srw)
Copied to clipboard
| Challenge: | Structured span extraction research is siloed by context length, annotation task, and domain . Identifying a span within a natural language text and affixing it with a semantic label has been considered a core task in NLP . |
| Approach: | They propose a framework for structured span annotation that integrates five datasets under a common JSONL format with character-level offsets. |
| Outcome: | The proposed framework can generalize across four domains under three prompting configurations. |
Seq2seq is All You Need for Coreference Resolution (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on coreference resolution suggests task-specific models are necessary . a recent line of work that take an alternative approach leveraging advances in seq2seq-based models is needed . |
| Approach: | They propose a pretrained seq2seq transformer to map an input document to a tagged sequence encoding the coreference annotation. |
| Outcome: | The proposed model outperforms or matches the best coreference systems on an array of datasets. |