Open AccessProceedings Article
Coreference Resolution with and without Linguistic Knowledge
Olga Uryupina
- 01 May 2006
- pp 893-898
TL;DR: This paper proposes to extend the standard feature set substantially, incorporating more linguistic knowledge, and evaluates the system for a variety of machine learners on the standard dataset (MUC-7) with the traditional learning set-up.
read more
Abstract: State-of-the-art statistical approaches to the Coreference Resolution task rely on sophisticated modeling, but very few (10-20) simple features. In this paper we propose to extend the standard feature set substantially, incorporating more linguistic knowledge. To investigate the usability of linguistically motivated features, we evaluate our system for a variety of machine learners on the standard dataset (MUC-7) with the traditional learning set-up.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
BART: A Modular Toolkit for Coreference Resolution
Yannick Versley,Simone Paolo Ponzetto,Massimo Poesio,Vladimir Eidelman,Alan Jern,Jason Smith,Xiaofeng Yang,Alessandro Moschitti +7 more
- 16 Jun 2008
TL;DR: BART as discussed by the authors is a highly modular toolkit for developing coreference applications, which was used to extend a reimplementation of the Soon et al (2001) proposal with a variety of additional syntactic and knowledge-based features, and experiment with alternative resolution processes, preprocessing tools, and classifiers.
Removing the Training Wheels: A Coreference Dataset that Entertains Humans and Challenges Computers
Anupam Guha,Mohit Iyyer,Danny Bouman,Jordan Boyd-Graber +3 more
- 01 Jan 2015
TL;DR: This work uses the quiz bowl community to develop a new coreference dataset, together with an annotation framework that can tag any text data with coreferences and named entities, and successfully integrates active learning into this annotation pipeline to collect documents maximally useful to coreference models.
Vagueness and Referential Ambiguity in a Large-Scale Annotated Corpus
TL;DR: It is argued that difficulties in the definition of coreference itself contribute to lower inter-annotator agreement in certain cases, and a generalisation of Poesio, Reyle and Stevenson's Justified Sloppiness Hypothesis is proposed to provide a unified model for these cases of disagreement.
•Proceedings Article
Coreference Resolution across Corpora: Languages, Coding Schemes, and Preprocessing Information
Marta Recasens,Eduard Hovy +1 more
- 11 Jul 2010
TL;DR: The experiments reveal problems in coreference resolution evaluation relating to task definition, coding schemes, and features and expose systematic biases in the coreference evaluation metrics.
•Proceedings Article
Corry: A System for Coreference Resolution
Olga Uryupina
- 15 Jul 2010
TL;DR: Corry is a system for coreference resolution in English that supports both local and global models of coreference, and has shown the best performance level among all the systems in their track for the corresponding metric.
18
References
•Book
The Nature of Statistical Learning Theory
Vladimir Vapnik
- 01 Jan 1995
TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
46K
•Book
C4.5: Programs for Machine Learning
J. Ross Quinlan
- 15 Oct 1992
TL;DR: A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
27.2K
Introduction to WordNet: An On-line Lexical Database
TL;DR: Standard alphabetical procedures for organizing lexical information put together words that are spelled alike and scatter words with similar or related meanings haphazardly through the list.
Making large scale SVM learning practical
TL;DR: SVM light as discussed by the authors is an implementation of an SVM learner which addresses the problem of large-scale SVM training with many training examples on the shelf, which makes large scale SVM learning more practical.
5K
Fast effective rule induction
William W. Cohen
- 09 Jul 1995
TL;DR: This paper evaluates the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems, and proposes a number of modifications resulting in an algorithm RIPPERk that is very competitive with C4.5 and C 4.5rules with respect to error rates, but much more efficient on large samples.
4.5K