Graph Refinement for Coreference Resolution
The state-of-the-art models for coreference resolution are based on independent mention pair-wise decisions. We propose a modelling approach that learns coreference at the document-level and takes global decisions. For this purpose, we model coreference links in a graph structure where the nodes are tokens in the text, and the edges represent the relationship between them. Our model predicts the graph in a non-autoregressive manner, then iteratively refines it based on previous predictions, allowing global dependencies between decisions. The experimental results show improvements over various baselines, reinforcing the hypothesis that document-level information improves conference resolution.
Code (0)
등록된 구현이 없습니다.
Tasks
coreference-resolutionCoreference ResolutionSimilar Papers 제목 키워드 기반
Graph Refinement for Coreference Resolution
The state-of-the-art models for coreference resolution are based on independent mention pair-wise decisions. We propose a modelling approach that learns coreference at the document-level and takes global decisions. For t…
coreference-resolutionCoreference ResolutionPredicting Coreference in Abstract Meaning Representations
This work addresses coreference resolution in Abstract Meaning Representation (AMR) graphs, a popular formalism for semantic parsing. We evaluate several current coreference resolution techniques on a recently published …
Abstract Meaning Representationcoreference-resolutionCoreference ResolutionSemantic ParsingVariational Graph Autoencoding as Cheap Supervision for AMR Coreference Resolution
Coreference resolution over semantic graphs like AMRs aims to group the graph nodes that represent the same entity. This is a crucial step for making document-level formal semantic representations. With annotated data on…
coreference-resolutionCoreference ResolutionCoreference Resolution in Research Papers from Multiple Domains
Coreference resolution is essential for automatic text understanding to facilitate high-level information retrieval tasks such as text summarisation or question answering. Previous work indicates that the performance of …
coreference-resolutionCoreference ResolutionInformation RetrievalRetrieval+1Filling in the Gaps: Efficient Event Coreference Resolution using Graph Autoencoder Networks
We introduce a novel and efficient method for Event Coreference Resolution (ECR) applied to a lower-resourced language domain. By framing ECR as a graph reconstruction task, we are able to combine deep semantic embedding…
coreference-resolutionCoreference ResolutionEvent Coreference ResolutionGraph Reconstruction