Ranking algorithms for named-entity extraction: Boosting and the voted perceptron

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2002-July, Issue , 2002, Pages 489-496

  Collins, Michael ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MAXIMUM ENTROPY METHODS;

BOOSTING ALGORITHM; MAXIMUM-ENTROPY; NAMED ENTITIES; NAMED ENTITY EXTRACTION; PERCEPTRON ALGORITHMS; RANKING ALGORITHM; RANKING PROBLEMS; TEST EXAMPLES; WEB DATA;

COMPUTATIONAL EFFICIENCY;

EID: 85045072379     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Abney, S. 1997. Stochastic Attribute-Value Grammars. Computational Linguistics, 23(4):597-618.
2. Bikel, D., Schwartz, R., and Weischedel, R. (1999). An Algorithm that Learns What's in a Name. In Machine Learning: Special Issue on Natural Language Learning, 34(1-3).
3. Borthwick, A., Sterling, J., Agichtein, E., and Grishman, R. (1998). Exploiting Diverse Knowledge Sources via Maximum Entropy in Named Entity Recognition. Proc. of the Sixth Workshop on Very Large Corpora.
4. Collins, M. (1999). Head-Driven Statistical Models for Natural Language Parsing. PhD Thesis, University of Pennsylvania.
5. Collins, M. (2000). Discriminative Reranking for Natural Language Parsing. Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000).
6. Collins, M., and Duffy, N. (2001). Convolution Kernels for Natural Language. In Proceedings of NIPS 14.
7. Collins, M., and Duffy, N. (2002). New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. In Proceedings of ACL 2002.
8. Collins, M. (2002). Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with the Perceptron Algorithm. In Proceedings of EMNLP 2002.
9. Cristianini, N., and Shawe-Tayor, J. (2000). An introduction to Support Vector Machines and other kernel-based learning methods. Cambridge University Press.
10. Della Pietra, S., Della Pietra, V., and Lafferty, J. (1997). Inducing Features of Random Fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(4), pp. 380-393.
11. Freund, Y. & Schapire, R. (1999). Large Margin Classification using the Perceptron Algorithm. In Machine Learning, 37(3):277-296.
12. Freund, Y., Iyer, R., Schapire, R.E., & Singer, Y. (1998). An efficient boosting algorithm for combining preferences. In Machine Learning: Proceedings of the Fifteenth International Conference.
13. Johnson, M., Geman, S., Canon, S., Chi, Z. and Riezler, S. (1999). Estimators for Stochastic "Unification-based" Grammars. Proceedings of the ACL 1999.
14. Lafferty, J., McCallum, A., and Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML 2001.
15. McCallum, A., Freitag, D., and Pereira, F. (2000) Maximum entropy markov models for information extraction and segmentation. In Proceedings of ICML 2000.
16. Ratnaparkhi, A. (1996). A maximum entropy part-of-speech tagger. In Proceedings of the empirical methods in natural language processing conference.
17. Rosenblatt, F. (1958). The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain. Psychological Review, 65, 386-408. (Reprinted in Neurocomputing (MIT Press, 1998).)
18. Walker, M., Rambow, O., and Rogati, M. (2001). SPoT: a trainable sentence planner. In Proceedings of the 2nd Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL 2001).