| Challenge: | Neural coreference resolution models trained on one dataset may not transfer to new, low-resource domains. |
| Approach: | They investigate how to actively label coreference by sampling a small subset of data for annotators to label. |
| Outcome: | The proposed model can be more realistic when labeling spans within the same document than when annotating spans across documents. |
Similar Papers
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. |
Pre-training Mention Representations in Coreference Models (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to improve coreference resolution use labeled data. |
| Approach: | They propose two self-supervised tasks that are closely related to coreference resolution to improve mention representation. |
| Outcome: | The proposed models improve mention representations by learning them on a GAP dataset. |
Moving on from OntoNotes: Coreference Resolution Model Transfer (2021.emnlp-main)
Copied to clipboard
| Challenge: | Academic neural models for coreference resolution (coref) are typically trained on OntoNotes and model improvements are benchmarked on that dataset. |
| Approach: | They aim to quantify transferability of coref models based on the number of annotated documents available in the target dataset. |
| Outcome: | The proposed model improvements are consistent with the state-of-the-art results on PreCo. |
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. |
A Neural Model for Aggregating Coreference Annotation in Crowdsourcing (2020.coling-main)
Copied to clipboard
| Challenge: | Existing studies of natural language labelling tasks have shown that crowd-sourced labels can be noisy. |
| Approach: | They split the aggregation into mention classification and coreference chain inference tasks to predict the correct labels. |
| Outcome: | The proposed model predicts the class of each mention using an autoencoder while taking into account the mention’s annotation complexity and annotators’ reliability at different levels. |
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. |
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. |
Active Learning for Sequence Tagging with Deep Pre-trained Models and Bayesian Uncertainty Estimates (2021.eacl-main)
Copied to clipboard
Artem Shelmanov, Dmitri Puzyrev, Lyubov Kupriyanova, Denis Belyakov, Daniil Larionov, Nikita Khromov, Olga Kozlova, Ekaterina Artemova, Dmitry V. Dylov, Alexander Panchenko
| Challenge: | Annotating training data for sequence tagging of texts is usually very time-consuming . active learning can help to reduce the amount of annotation required to train a good model by multiple times . |
| Approach: | They are the first to thoroughly investigate active learning and transfer learning for natural language processing . they propose to combine active learning with active learning to improve model acquisition . |
| Outcome: | The proposed combination of active learning and Bayesian uncertainty estimation improves performance and reduces obstacles for applying it in practice. |
Reassessing Active Learning Adoption in Contemporary NLP: A Community Survey (2026.eacl-long)
Copied to clipboard
| Challenge: | a longstanding strategy to reduce annotation costs is active learning . data annotation is expected to remain important and active learning to stay relevant . |
| Approach: | They conduct an online survey to assess the perceived relevance of data annotation and active learning . they propose a strategy to reduce annotation costs using active learning, an iterative process . |
| Outcome: | The proposed strategies reduce setup complexity and uncertainty cost while maintaining model performance. |
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. |