To access the full text documents, please follow this link: http://hdl.handle.net/2117/86945

A graph partitioning approach to coreference resolution
Sapena Masip, Emilio; Padró, Lluís; Turmo Borras, Jorge
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. GPLN - Grup de Processament del Llenguatge Natural
This report presents a graph partitioning approach given a set of constraints to resolve coreferences. Coreference resolution is the task of determining which referring expressions in a discourse refer to the same entity. Coreference resolution is a natural language processing task which has a direct effect on the field of Text Mining and its related areas such as Information Extraction, Question Answering, Summarization, Machine Translation. This report summarizes the research done in coreference resolution and presents our machine learning graph-based system and our baseline with preliminary results in comparison with other machine learning systems in the state of the art.
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
Coreference
Anaphora
Natural language processing
Text mining
info:eu-repo/semantics/publishedVersion
Report
         

Show full item record

Related documents

Other documents of the same author

Sapena Masip, Emilio; Padró, Lluís; Turmo Borras, Jorge
Sapena Masip, Emilio; Padró, Lluís; Turmo Borras, Jorge
Sapena Masip, Emilio; Padró, Lluís; Turmo Borras, Jorge
Sapena Masip, Emilio; Padró, Lluís; Turmo Borras, Jorge
Sapena Masip, Emilio; Padró, Lluís; Turmo Borras, Jorge
 

Coordination

 

Supporters