Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution

Autor
Sapena, E.; Padro, L.; Turmo, J.
Tipus d'activitat
Article en revista
Revista
Computational linguistics
Data de publicació
2013-12
Volum
39
Número
4
Pàgina inicial
847
Pàgina final
884
DOI
https://doi.org/10.1162/COLI_a_00151 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/20965 Obrir en finestra nova
URL
http://www.mitpressjournals.org/toc/coli/39/4 Obrir en finestra nova
Resum
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...
Citació
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.
Grup de recerca
GPLN - Grup de Processament del Llenguatge Natural
IDEAI-UPC Intelligent Data Science and Artificial Intelligence
TALP - Centre de Tecnologies i Aplicacions del Llenguatge i la Parla

Participants

Arxius