Show simple item record

dc.contributor.authorSapena Masip, Emilio
dc.contributor.authorPadró, Lluís
dc.contributor.authorTurmo Borras, Jorge
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2013-12-10T19:11:30Z
dc.date.available2013-12-10T19:11:30Z
dc.date.created2013-12
dc.date.issued2013-12
dc.identifier.citationSapena, 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.
dc.identifier.issn0891-2017
dc.identifier.urihttp://hdl.handle.net/2117/20965
dc.description.abstractThis 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 performance using world knowledge extracted from Wikipedia. The developed approach is able to use an entity-mention classification model with more expressiveness than the pair-based ones, and overcome the weaknesses of previous approaches in the state of the art such as linking contradictions, classifications without context, and lack of information evaluating pairs. Furthermore, the approach allows the incorporation of new information by adding constraints, and research has been done in order to use world knowledge to improve performances. RelaxCor, the implementation of the approach, achieved results at the state-of-the-art level, and participated in international competitions: SemEval-2010 and CoNLL-2011. RelaxCor achieved second place in CoNLL-2011.
dc.format.extent38 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Llenguatges de programació
dc.subject.lcshHypergraphs
dc.subject.lcshComputational linguistics
dc.titleA Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution
dc.typeArticle
dc.subject.lemacTractament del llenguatge natural (Informàtica)
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. GPLN - Grup de Processament del Llenguatge Natural
dc.identifier.doi10.1162/COLI_a_00151
dc.relation.publisherversionhttp://www.mitpressjournals.org/toc/coli/39/4
dc.rights.accessOpen Access
local.identifier.drac12915158
dc.description.versionPostprint (published version)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/247762/EU/Feedback Analysis for User adaptive Statistical Translation/FAUST
local.citation.authorSapena, E.; Padro, L.; Turmo, J.
local.citation.publicationNameComputational linguistics
local.citation.volume39
local.citation.number4
local.citation.startingPage847
local.citation.endingPage884


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record