| Challenge: | a new approach to coreference resolution uses a span-ranking architecture as an attention mechanism to iteratively refine span representations. |
| Approach: | They propose a fully-differentiable approximation to higher-order inference for coreference resolution . they propose introducing a coarse-to-fine approach that incorporates a less accurate but more efficient bilinear factor . |
| Outcome: | The proposed model significantly improves accuracy on the English OntoNotes benchmark while being far more computationally efficient. |
Similar Papers
Revealing the Myth of Higher-Order Inference in Coreference Resolution (2020.emnlp-main)
Copied to clipboard
| Challenge: | Adapted coreference resolution models have only marginally improved performance over representation learning. |
| Approach: | They implement an end-to-end coreference system and four HOI approaches to analyze the impact of higher-order inference on coreference resolution. |
| Outcome: | The proposed model shows that the impact of higher-order inference (HOI) on coreference resolution is negative to marginal, providing a new perspective on the task. |
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. |
Scaling Within Document Coreference to Long Texts (2021.findings-acl)
Copied to clipboard
Raghuveer Thirukovalluru, Nicholas Monath, Kumar Shridhar, Manzil Zaheer, Mrinmaya Sachan, Andrew McCallum
| Challenge: | Existing end-to-end coreference resolution models use expensive span representations and antecedent prediction mechanisms. |
| Approach: | They propose an approximation to end-to-end coreference resolution models which scales gracefully to documents of any length. |
| Outcome: | The proposed model reduces training and inference time and memory costs compared to current models with minimal loss in accuracy. |
Coreference Resolution without Span Representations (2021.acl-short)
Copied to clipboard
| Challenge: | Pretraining has reduced many complex task-specific NLP models to simple lightweight layers. |
| Approach: | They propose a lightweight end-to-end coreference model that removes the dependency on span representations, handcrafted features, pruning heuristics, and more. |
| Outcome: | The proposed model performs competitively with the current standard model, while being simpler and more efficient. |
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. |
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. |
End-to-end Deep Reinforcement Learning Based Coreference Resolution (P19-1)
Copied to clipboard
| Challenge: | Recent neural network models for coreference resolution are usually trained with heuristic loss functions that are computed over a sequence of local decisions. |
| Approach: | They propose an end-to-end reinforcement learning based coreference resolution model to directly optimize coreference evaluation metrics. |
| Outcome: | The proposed model achieves new state-of-the-art performance on the English OntoNotes v5.0 benchmark. |
Cross-document Coreference Resolution over Predicted Mentions (2021.findings-acl)
Copied to clipboard
| Challenge: | Cross-document coreference resolution has been under-explored in recent years . however, the challenge of cross-document resolution remains relatively under-studied . |
| Approach: | They propose a model for cross-document coreference resolution from raw text that extends a prominent withindocument corefer model to the CD setting. |
| Outcome: | The proposed model achieves competitive results for event and entity coreference resolution on gold mentions. |
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. |
Coreference Resolution with Entity Equalization (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to coreference resolution capture the properties of entity clusters and use them in the resolution process. |
| Approach: | They propose an approach that captures entities and uses them in coreference resolution . they propose an "Entity Equalization" mechanism that represents each mention in a cluster . |
| Outcome: | The proposed approach improves the CoNLL-2012 coreference resolution task by 3.6%. |