Applications of finite-state transducers in natural language processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2088, Issue , 2001, Pages 34-46

  Karttunen, Lauri ^a  

^a XEROX RESEARCH CENTRE EUROPE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SYNTACTICS; TRANSDUCERS;

EXTENDED REGULAR EXPRESSIONS; FINITE STATE; FINITE STATE TRANSDUCERS; LEXICAL TRANSDUCER; LINGUISTIC PHENOMENA; MORPHOLOGICAL ANALYSIS; NATURAL LANGUAGE PROCESSING; SYNTACTIC PATTERNS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84954446269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44674-5_2     Document Type: Conference Paper

References (18)

1. Kenneth R. Beesley and Lauri Karttunen. Finite-State Morphology: Xerox Tools and Techniques. Cambridge University Press, 2000. To appear.
2. Kenneth R. Beesley and Lauri Karttunen. Finite-state non-concatenative morphotactics. In Lauri Karttunen Jason Eisner and Alain Thériault, editors, SIGPHON-2000, pages 1-12, August 6 2000. Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology.
3. N. Chomsky. Syntactic Structures. Mouton, Gravenhage, Netherlands, 1957.
4. Noam Chomsky and Morris Halle. The Sound Pattern of English. Harper and Row, New York, 1968.
5. Edmund Grimley-Evans, George Anton Kiraz, and Stephen G. Pulman. Compiling a partition-based two-level formalism. In Proceedings of the 16th International Conference on Computational Linguistics, Copenhagen, 1996.
6. C. Douglas Johnson. Formal Aspects of Phonological Description. Mouton, The Hague, 1972.
7. Ronald M. Kaplan and Martin Kay. Phonological rules and finite-state transducers. In Linguistic Society of America Meeting Handbook, Fifty-Sixth Annual Meeting, New York, December 27-30 1981. Abstract.
8. Ronald M. Kaplan and Martin Kay. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-378, 1994.
9. Lauri Karttunen. Finite-state lexicon compiler. Technical Report ISTL-NLTT-1993-04-02, Xerox Palo Alto Research Center, Palo Alto, CA, April 1993.
10. Lauri Karttunen. The replace operator. In ACL'95, Cambridge, MA, 1995. cmp-lg/9504032.
11. Lauri Karttunen. Directed replacement. In ACL'96, Santa Cruz, CA, 1996. cmp-lg/9606029.
12. Lauri Karttunen and Kenneth R. Beesley. Two-level rule compiler. Technical Report ISTL-92-2, Xerox Palo Alto Research Center, Palo Alto, CA, October 1992.
13. Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller. Regular expressions for language engineering. Journal of Natural Language Engineering, 2(4):305-328, 1996.
14. Lauri Karttunen, Kimmo Koskenniemi, and Ronald M. Kaplan. A compiler for two-level phonological rules. Technical report, Xerox Palo Alto Research Center and Center for the Study of Language and Information, Stanford University, June 25 1987.
15. Andrfie Kempe and Lauri Karttunen. Parallel replacement in finite-state calculus. In COLING'96, Copenhagen, August 5-9 1996. cmp-lg/9607007.
16. Kimmo Koskenniemi. Two-level morphology: A general computational model for word-form recognition and production. Publication 11, University of Helsinki, Department of General Linguistics, Helsinki, 1983.
17. Mehryar Mohri and Richard Sproat. An efficient compiler for weighted rewrite rules. In ACL'96, Santa Cruz, CA, 1996.
18. Gertjan van Noord and Dale Gerdemann. An extendible regular expression compiler for finite-state approaches in natural language processing. In O. Boldt, H. Juergensen, and L. Robbins, editors, Workshop on Implementing Automata; WIA99 Pre-Proceedings, Potsdam Germany, 1999.