Bootstrapping morphological analyzers by combining human elicitation and machine learning

Computational Linguistics

Volumn 27, Issue 1, 2001, Pages 58-85

  Oflazer, Kemal ^a   McShane, Marjorie ^b   Nirenburg, Sergei ^b  

^a SABANCI UNIVERSITY   (Turkey)

^b Computing Research Laboratory ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; LEARNING ALGORITHMS; MACHINE LEARNING; NATURAL LANGUAGE PROCESSING SYSTEMS; RESEARCH LABORATORIES;

BOOTSTRAPPING SCHEME; FINITE STATE TRANSDUCERS; LINGUISTIC INFORMATION; MORPHOLOGICAL ANALYZER; NATURAL LANGUAGE PROCESSING APPLICATIONS; SEMIAUTOMATIC TECHNIQUES; TESTING ENVIRONMENT; TRANSFORMATION-BASED LEARNING;

MACHINE COMPONENTS;

EID: 0039892030     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. Antworth, Evan L. 1990. PC-KIMMO: A two-level processor for Morphological Analysis. Occasional Publications in Academic Computing, Number 16. Summer Institute of Linguistics, Dallas, TX.
2. Beesley, Kenneth R. 1996. Arabic finite-state morphological analysis and generation. In Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), pages 89-94, Copenhagen, Denmark.
3. Brill, Eric. 1995. Transformation-based error-driven learning and natural language processing: A case study in part-of-speech tagging. Computational Linguistics, 21(4):543-566, December.
4. Damerau, F. J. 1964. A technique for computer detection and correction of spelling errors. Communications of the Association for Computing Machinery, 7(3):171-176.
5. Golding, Andrew and Henry S. Thompson. 1985. A morphology component for language programs. Linguistics, 23:263-284.
6. Goldsmith, John. 1998. Unsupervised learning of the morphology of a natural language. Unpublished manuscript, available at http: //humanities. uchicago.edu/faculty/goldsmith/ index.html.
7. Johnson, Mark. 1984. A discovery procedure for certain phonological rules. In Proceedings of 10th International Conference on Computational Linguistics (COLING'84), pages 344-347, Stanford, CA, USA.
8. Kaplan, Ronald M. and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-378, September.
9. Karttunen, Lauri. 1993. Finite-state lexicon compiler. Technical Report, XEROX, Palo Alto Research Center, April.
10. Karttunen, Lauri. 1994. Constructing lexical transducers. In Proceedings of the 15th International Conference on Computational Linguistics (COLING '94), volume 1, pages 406-411, Kyoto, Japan.
11. Karttunen, Lauri and Kenneth R. Beesley. 1992. Two-level rule compiler. Technical Report, XEROX Palo Alto Research Center.
12. Karttunen, Lauri, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller. 1996. Regular expressions for language engineering. Natural Language Engineering, 2(4):305-328.
13. Karttunen, Lauri, Ronald M. Kaplan, and Annie Zaenen. 1992. Two-level morphology with composition. In Proceedings of the 14th International Conference on Computational Linguistics, volume 1, pages 141-148, Nantes, France.
14. Kiraz, George Anton. 2000. Multitiered nonlinear morphology using multitape finite automata: A case study on Syriac and Arabic. Computational Linguistics, 26(1):77-105.
15. Koskenniemi, Kimmo. 1983. Two-level morphology: A general computational model for word form recognition and production. Publication No. 11, Department of General Linguistics, University of Helsinki.
16. Mohri, Mehryar, Fernando Pereira, and Michael Riley. 1998. A rational design for a weighted finite-state transducer library. In Lecture Notes in Computer Science, 1436. Springer Verlag.
17. Nirenburg, Sergei. 1998. Universal grammar and lexis for quick ramp-up of MT systems. In Proceedings of the First International Conference on Language Resources and Evaluation, pages 739-746, Spain.
18. Nirenburg, Sergei and Victor Raskin. 1998. Project Boas: "A Linguist in a Box" as a multi-purpose language resource. In COLING-ACL '98: 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, pages 975-979, Montreal, Quebec Canada.
19. Nirenburg, Sergei and Victor Raskin. 1999. Supply-side and demand-side lexical semantics. In Evelyne Viegas, editor, Depth and Breadth of Semantic Lexicons. Text, Speech, and Language Technology Series. Kluwer, Dordrecht and Boston.
20. Oflazer, Kemal. 1994. Two-level description of Turkish morphology. Literary and Linguistic Computing, 9(2):137-148.
21. Oflazer, Kemal. 1996. Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computational Linguistics, 22(1):73-90, March.
22. Ranta, Aarne. 1998. A multilingual natural language interface to regular expressions. In Lauri Kartrunen and Kemal Oflazer, editors, Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, FSMNLP'98, pages 79-90.
23. Rissanen, Jorma. 1989. Stochastic Complexity in Statistical Inquiry. World Scientific Publishing.
24. Satta, Giorgio and John C. Henderson. 1997. String transformation learning. In Proceedings of ACL/EACL'97.
25. Sproat, Richard. 1992. Morphology and Computation. MIT Press.
26. Theron, Pieter and Ian Cloete. 1997. Automatic acquisition of two-level morphological rules. In Proceedings of the 5th Conference on Applied Natural Language Processing.
27. van Noord, Gertjan. 1999. FSA6: Finite state automata utilities (version 6) manual. Available at http://odur.let.rug.nl/ van-noord/Fsa/Manual/.
28. van Noord, Gertjan and Dale Gerdemann. 1999 An extendible regular expression compiler for finite-state approaches in natural language processing. In Proceedings of WIA 99.