Unsupervised Models for Named Entity Classification

Proceedings of the 1999 Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora, EMNLP 1999

Volumn , Issue , 1999, Pages 100-110

  Collins, Michael ^a   Singer, Yoram ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOSTING ALGORITHM; NAMED ENTITIES; NAMED ENTITY CLASSIFICATION; SIMPLE++; UNLABELED DATA;

MACHINE LEARNING;

EID: 85119383022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. M. Berland and E. Charniak. 1999. Finding Parts in Very Large Corpora. In Proceedings of the the 37th Annual Meeting of the Association for Computational Linguistics (ACL-99).
2. D. M. Bikel, S. Miller, R. Schwartz, and R. Weischedel. 1997. Nymble: a High-Performance Learning Name-finder. In Proceedings of the Fifth Conference on Applied Natural Language Processing, pages 194-201.
3. A. Blum and T. Mitchell. 1998. Combining Labeled and Unlabeled Data with Co-Training. In Proceedings of the 11th Annual Conference on Computational Learning Theory (COLT-98).
4. E. Brill. 1995. Unsupervised Learning of Disambiguation Rules for Part of Speech Tagging. In Proceedings of the ThirdWorkshoponVeryLargeCorpora.
5. S. Brin. 1998. Extracting Patterns and Relations from the World Wide Web. In WebDB Wokshop at EDBT '98.
6. M. Collins. 1996. A New Statistical Parser Based on Bi-gram Lexical Dependencies. Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, pages 184-191.
7. A.P. Dempster, N.M. Laird, and D.B. Rubin, (1977). Maximum Likelihood from Incomplete Data Via the EM Algorithm, Journal of the Royal Statistical Society, Ser B, 39, 1-38.
8. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256-285, 1995.
9. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1): 119-139, 1997.
10. M. Hearst. 1992. Automatic Acquisition of Hyponyms from Large Text Corpora. In Proceedings of the Fourteenth International Conference on Computational Linguistics.
11. Michael Kearns. Thoughts on hypothesis boosting. Unpublished manuscript, December 1988.
12. J. Lafferty. Additive Models, Boosting, and Inference for Generalized Divergences. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999.
13. Proceedings of the Sixth Message Understanding Conference (MUC-6). Morgan Kaufmann, San Mateo, CA.
14. E. Riloff and J. Shepherd. 1997. A Corpus-Based Approach for Building Semantic Lexicons. In Proceedings of the Second Conference on Empirical Methods in Natural Language Processing (EMNLP-2).
15. E. Riloff and R. Jones. 1999. Learning Dictionaries for Information Extraction by Multi-Level Bootstrapping. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99).
16. R. E. Schapire. The strength of weak learnability. Machine Learning, 5(2): 197-227, 1990.
17. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 80-91, 1998. To appear, Machine Learning.
18. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, November 1984.
19. D. Yarowsky. 1995. Unsupervised Word Sense Disambiguation Rivaling Supervised Methods.In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics. Cambridge, MA, pp. 189-196.