Bootstrapping POS taggers using Unlabelled Data

Proceedings of the 7th Conference on Natural Language Learning, CoNLL 2003 at HLT-NAACL 2003

Volumn , Issue , 2003, Pages 49-55

  Clark, Stephen ^a   Curran, James R ^a   Osborne, Miles ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; INDUSTRIAL PLANTS; NATURAL LANGUAGE PROCESSING SYSTEMS;

CO-TRAINING; COMPUTATIONAL COSTS; LABELED DATA; PART-OF-SPEECH TAGGER; PERFORMANCE; SELF-TRAINING; TRAINING SETS; UNLABELED DATA;

ITERATIVE METHODS;

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

References (18)

1. Steven Abney. 2002. Bootstrapping. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, pages 360–367, Philadelphia, PA.
2. Avrim Blum and Tom Mitchell. 1998. Combining labeled and unlabeled data with co-training. In Proceedings of the 11th Annual Conference on Computational Learning Theory, pages 92–100, Madisson, WI.
3. Thorsten Brants. 2000. TnT - a statistical part-of-speech tagger. In Proceedings of the 6th Conference on Applied Natural Language Processing, pages 224–231.
4. Michael Collins and Yoram Singer. 1999. Unsupervised models for named entity classification. In Proceedings of the Empirical Methods in NLP Conference, pages 100–110, University of Maryland, MD.
5. Silviu Cucerzan and David Yarowsky. 2002. Bootstrapping a multilingual part-of-speech tagger in one person-day. In Proceedings of the 6th Workshop on Computational Language Learning, Taipei, Taiwan.
6. th Annual Meeting of the European Chapter of the Association for Computational Linguistics, Budapest, Hungary. (to appear).
7. J. N. Darroch and D. Ratcliff. 1972. Generalized iterative scaling for log-linear models. The Annals of Mathematical Statistics, 43(5):1470–1480.
8. Sanjoy Dasgupta, Michael Littman, and David McAllester. 2002. PAC generalization bounds for co-training. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 375–382, Cambridge, MA. MIT Press.
9. th Conference on Applied Natural Language Processing, pages 53–58, Stuttgart, Germany.
10. Sally Goldman and Yan Zhou. 2000. Enhancing supervised learning with unlabeled data. In Proceedings of the 17th International Conference on Machine Learning, Stanford, CA.
11. Robert Malouf. 2002. A comparison of algorithms for maximum entropy parameter estimation. In Proceedings of the Sixth Workshop on Natural Language Learning, pages 49–55, Taipei, Taiwan.
12. Bernard Merialdo. 1994. Tagging English text with a probabilistic model. Computational Linguistics, 20(2):155–171.
13. David Pierce and Claire Cardie. 2001. Limitations of co-training for natural language learning from large datasets. In Proceedings of the Empirical Methods in NLP Conference, Pittsburgh, PA.
14. Adwait Ratnaparkhi. 1996. A maximum entropy part-of-speech tagger. In Proceedings of the EMNLP Conference, pages 133–142, Philadelphia, PA.
15. Anoop Sarkar. 2001. Applying co-training methods to statistical parsing. In Proceedings of the 2nd Annual Meeting of the NAACL, pages 95–102, Pittsburgh, PA.
16. Mark Steedman, Miles Osborne, Anoop Sarkar, Stephen Clark, Rebecca Hwa, Julia Hockenmaier, Paul Ruhlen, Steven Baker, and Jeremiah Crim. 2003. Bootstrapping statistical parsers from small datasets. In Proceedings of the 11th Annual Meeting of the European Chapter of the Association for Computational Linguistics, Budapest, Hungary. (to appear).
17. David Yarowsky. 1995. Unsupervised word sense disambiguation rivaling supervised methods. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, pages 189–196, Cambridge, MA.
18. Jakub Zavrel and Walter Daelemans. 2000. Bootstrapping a tagged corpus through combination of existing heterogeneous taggers. In Proceedings of the 2nd International Conference on Language Resources and Evaluation, pages 17–20, Athens, Greece.