Recent work has shown that explicitly iden-tifying and filtering non-anaphoric mentions prior to coreference resolution can improve the performance of a coreference system. We present a novel approach to this task of anaphoricity determination based on graph cuts, and demonstrate its superiority to com-peting approaches by comparing their effec-tiveness in improving a learning-based coref-erence system on the ACE data sets.
Machine learning methods have been successfully applied to a number of language technology tasks. Th...
Coreference resolution is the task of finding all expressions that refer to the same entity in a tex...
Recently, many advanced machine learning approaches have been proposed for coreference resolution; h...
This paper introduces a new structured model for learning anaphoricity detection and coreference res...
We introduce a simple, non-linear mention-ranking model for coreference resolution that attempts to ...
Interpreting anaphoric references is a fundamental aspect of our language competence that has long a...
This report presents a graph partitioning approach given a set of constraints to resolve coreference...
Coreference resolution is a challenging natural language processing task, and it is difficult to ide...
Interpreting anaphoric expressions is one of the most fundamental aspects of lan-guage interpretatio...
Abstract. This paper systematically explores the effectiveness of dependency and constituent-based s...
Coreference Resolution is an important step in many NLP tasks and has been a popular topic within th...
Abstract In this Chapter we discuss proposals concerning the detection of non-referentiality and non...
This paper presents the design of an online evaluation service for coreference resolution in texts. ...
Anaphoric reference is an aspect of language interpretation covering a variety of types of interpret...
Traditional learning-based coreference re-solvers operate by training a mention-pair classifier for ...
Machine learning methods have been successfully applied to a number of language technology tasks. Th...
Coreference resolution is the task of finding all expressions that refer to the same entity in a tex...
Recently, many advanced machine learning approaches have been proposed for coreference resolution; h...
This paper introduces a new structured model for learning anaphoricity detection and coreference res...
We introduce a simple, non-linear mention-ranking model for coreference resolution that attempts to ...
Interpreting anaphoric references is a fundamental aspect of our language competence that has long a...
This report presents a graph partitioning approach given a set of constraints to resolve coreference...
Coreference resolution is a challenging natural language processing task, and it is difficult to ide...
Interpreting anaphoric expressions is one of the most fundamental aspects of lan-guage interpretatio...
Abstract. This paper systematically explores the effectiveness of dependency and constituent-based s...
Coreference Resolution is an important step in many NLP tasks and has been a popular topic within th...
Abstract In this Chapter we discuss proposals concerning the detection of non-referentiality and non...
This paper presents the design of an online evaluation service for coreference resolution in texts. ...
Anaphoric reference is an aspect of language interpretation covering a variety of types of interpret...
Traditional learning-based coreference re-solvers operate by training a mention-pair classifier for ...
Machine learning methods have been successfully applied to a number of language technology tasks. Th...
Coreference resolution is the task of finding all expressions that refer to the same entity in a tex...
Recently, many advanced machine learning approaches have been proposed for coreference resolution; h...