Add to ORKGThis paper describes the participation of RelaxCor in the CoNLL-2011 shared task: "Modeling Unrestricted Coreference in Ontonotes". 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
<p>According to the two-dimensional classification of coreference resolution systems, the proposed S...
Coreference resolution is one of the most fundamental Natural Language Processing tasks, aiming to i...
We describe our system for the CoNLL-2012 shared task, which seeks to model corefer-ence in OntoNote...
This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference R...
This paper presents a constraint-based graph partitioning approach to coreference resolution solved ...
This paper presents the integration of RelaxCor into FreeLing. RelaxCor is a coreference resolution ...
This work is focused on research in machine learning for coreference resolution. Coreference resolut...
This report presents a graph partitioning approach given a set of constraints to resolve coreference...
The objectives of this thesis are focused on research in machine learning for coreference resolutio...
We propose an algorithm for coreference resolution based on analogy with shift-reduce pars-ing. By r...
In this paper, we describe a coreference solver based on the extensive use of lexical fea-tures and ...
We describe a scaffolding approach to the task of coreference resolution that incrementally combines...
We describe a structure learning system for unrestricted coreference resolution that explores two ke...
Graphical visualizations of coreference chains support a system developer in analyzing the be-havior...
This paper presents our participation in the CoNLL-2011 shared task, Modeling Unrestricted Coreferen...
<p>According to the two-dimensional classification of coreference resolution systems, the proposed S...
Coreference resolution is one of the most fundamental Natural Language Processing tasks, aiming to i...
We describe our system for the CoNLL-2012 shared task, which seeks to model corefer-ence in OntoNote...
This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference R...
This paper presents a constraint-based graph partitioning approach to coreference resolution solved ...
This paper presents the integration of RelaxCor into FreeLing. RelaxCor is a coreference resolution ...
This work is focused on research in machine learning for coreference resolution. Coreference resolut...
This report presents a graph partitioning approach given a set of constraints to resolve coreference...
The objectives of this thesis are focused on research in machine learning for coreference resolutio...
We propose an algorithm for coreference resolution based on analogy with shift-reduce pars-ing. By r...
In this paper, we describe a coreference solver based on the extensive use of lexical fea-tures and ...
We describe a scaffolding approach to the task of coreference resolution that incrementally combines...
We describe a structure learning system for unrestricted coreference resolution that explores two ke...
Graphical visualizations of coreference chains support a system developer in analyzing the be-havior...
This paper presents our participation in the CoNLL-2011 shared task, Modeling Unrestricted Coreferen...
<p>According to the two-dimensional classification of coreference resolution systems, the proposed S...
Coreference resolution is one of the most fundamental Natural Language Processing tasks, aiming to i...
We describe our system for the CoNLL-2012 shared task, which seeks to model corefer-ence in OntoNote...