HyperAIHyperAI

Command Palette

Search for a command to run...

3 months ago

Graph Refinement for Coreference Resolution

Lesly Miculicich James Henderson

Graph Refinement for Coreference Resolution

Abstract

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 Repositories

Benchmarks

BenchmarkMethodologyMetrics
coreference-resolution-on-ontonotesG2GT SpanBERT-large overlap
F1: 80.2
coreference-resolution-on-ontonotesG2GT SpanBERT-large reduced
F1: 80.5

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
Graph Refinement for Coreference Resolution | Papers | HyperAI