Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COLING
2010

favoriteEmaildiscussreport

125views Computational Linguistics» more COLING 2010»

A Global Relaxation Labeling Approach to Coreference Resolution

12 years 11 months ago

A Global Relaxation Labeling Approach to Coreference Resolution

Download aclweb.org

This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference Resolution in Multiple Languages". RelaxCor is a constraint-based graph partitioning approach to coreference resolution solved by relaxation labeling. The approach combines the strengths of groupwise classifiers and chain formation methods in one global method.

Emili Sapena, Lluís Padró, Jordi Tur

Real-time Traffic

COLING 2010 | Computational Linguistics | Constraint-based Graph | Coreference Resolution | Semeval-2010 Task Number |

claim paper

Related Content

» Global Learning of Noun Phrase Anaphoricity in Coreference Resolution via Label Propagatio...

» A MultiPass Sieve for Coreference Resolution

» Joint Unsupervised Coreference Resolution with Markov Logic

» Unsupervised Coreference Resolution in a Nonparametric Bayesian Model

» Gesture Salience as a Hidden Variable for Coreference Resolution and Keyframe Extraction

» Relaxation Labeling Processes for Protein Secondary Structure Prediction

» TVBased MultiLabel Image Segmentation with Label Cost Prior

» Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach

» Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2010
Where	COLING
Authors	Emili Sapena, Lluís Padró, Jordi Turmo

Comments (0)