论文信息 - Boosting Applied to Tagging and PP Attachment

Boosting Applied to Tagging and PP Attachment

Boosting is a machine learning algorithm that is not well known in computational linguistics. We apply it to part-of-speech tagging and prepositional phrase attachment. Performance is very encouraging. We also show how to improve data quality by using boosting to identify annotation errors.

[1] Beatrice Santorini,et al. Building a Large Annotated Corpus of English: The Penn Treebank , 1993, CL.

[2] Richard M. Schwartz,et al. Coping with Ambiguity and Unknown Words through Probabilistic Models , 1993, CL.

[3] Adwait Ratnaparkhi,et al. A Maximum Entropy Model for Prepositional Phrase Attachment , 1994, HLT.

[4] Eric Brill,et al. A Rule-Based Approach to Prepositional Phrase Attachment Disambiguation , 1994, COLING.

[5] Michael Collins,et al. Prepositional Phrase Attachment through a Backed-off Model , 1995, VLC@ACL.

[6] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[7] David M. Magerman. Statistical Decision-Tree Models for Parsing , 1995, ACL.

[8] Adwait Ratnaparkhi,et al. A Maximum Entropy Model for Part-Of-Speech Tagging , 1996, EMNLP.

[9] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[10] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.

[11] Robert E. Schapire,et al. Using output codes to boost multiclass learning problems , 1997, ICML.

[12] Yoram Singer,et al. Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.

[13] Eric Brill,et al. Classifier Combination for Improved Lexical Disambiguation , 1998, ACL.