• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Improving Machine Learning Approaches to Noun Phrase Coreference Resolution (2004)

by Vincent Ng
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

Optimizing to arbitrary NLP metrics using ensemble selection

by Art Munson, Claire Cardie, Rich Caruana - In HLT-EMNLP , 2005
"... While there have been many successful applications of machine learning methods to tasks in NLP, learning algorithms are not typically designed to optimize NLP performance metrics. This paper evaluates an ensemble selection framework designed to optimize arbitrary metrics and automate the process of ..."
Abstract - Cited by 16 (4 self) - Add to MetaCart
While there have been many successful applications of machine learning methods to tasks in NLP, learning algorithms are not typically designed to optimize NLP performance metrics. This paper evaluates an ensemble selection framework designed to optimize arbitrary metrics and automate the process of algorithm selection and parameter tuning. We report the results of experiments that instantiate the framework for three NLP tasks, using six learning algorithms, a wide variety of parameterizations, and 15 performance metrics. Based on our results, we make recommendations for subsequent machine-learning-based research for natural language learning. 1
(Show Context)

Citation Context

...cluster if they are either predicted as coreferent by the classifier or if they are transitively predicted as coreferent through one or more other noun phrases. Instance selection (Soon et al., 2001; =-=Ng, 2004-=-) is used to increase the percentage of positive instances in the training set. 3 We use the learning features described by Ng and Cardie (2002). All learning algorithms are trained with the full set ...

Maximum Metric Score Training for Coreference Resolution

by Shanheng Zhao, Hwee Tou Ng
"... A large body of prior research on coreference resolution recasts the problem as a two-class classification problem. However, standard supervised machine learning algorithms that minimize classification errors on the training instances do not always lead to maximizing the F-measure of the chosen eval ..."
Abstract - Add to MetaCart
A large body of prior research on coreference resolution recasts the problem as a two-class classification problem. However, standard supervised machine learning algorithms that minimize classification errors on the training instances do not always lead to maximizing the F-measure of the chosen evaluation metric for coreference resolution. In this paper, we propose a novel approach comprising the use of instance weighting and beam search to maximize the evaluation metric score on the training corpus during training. Experimental results show that this approach achieves significant improvement over the state-of-the-art. We report results on standard benchmark corpora (two MUC corpora and three ACE corpora), when evaluated using the link-based MUC metric and the mention-based B-CUBED metric. 1
(Show Context)

Citation Context

...evaluation metric score on the training set and the classifier corresponding to the All-style baseline is one of the candidates. In addition, our MMST approach improves upon state-of-the-art results (=-=Ng, 2004-=-; Ng, 2005; Versley et al., 2008) on most of the five standard benchmark corpora (two MUC corpora and three ACE corpora), with both the link-based MUC metric and the mention-based B-CUBED metric. Fina...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University