Loading...
Loading...

Go to the content (press return)

A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution

Author
Sapena, E.; Padro, L.; Turmo, J.
Type of activity
Journal article
Journal
Computational linguistics
Date of publication
2013-12
Volume
39
Number
4
First page
847
Last page
884
DOI
https://doi.org/10.1162/COLI_a_00151 Open in new window
Repository
http://hdl.handle.net/2117/20965 Open in new window
URL
http://www.mitpressjournals.org/toc/coli/39/4 Open in new window
Abstract
This work is focused on research in machine learning for coreference resolution. Coreference resolution is a natural language processing task that consists of determining the expressions in a discourse that refer to the same entity. The main contributions of this article are (i) a new approach to coreference resolution based on constraint satisfaction, using a hypergraph to represent the problem and solving it by relaxation labeling; and (ii) research towards improving coreference resolution per...
Citation
Sapena, E.; Padro, L.; Turmo, J. A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution. "Computational linguistics", Desembre 2013, vol. 39, núm. 4, p. 847-884.
Group of research
GPLN - Natural Language Processing Group
IDEAI-UPC - Intelligent Data Science and Artificial Intelligence Research Center
TALP - Centre for Language and Speech Technologies and Applications

Participants

Attachments