Abstract

INTRODUCTION A lexical transducer, first discussed in Karttunen, Kaplan and Zaenen 1992, is a specialised finite-state automaton that maps inflected surface forms to lexical forms, and vice versa. The lexical form con- sists of a canonical representation of the word and a sequence of tags that show the morphological characteristics of the form in question-and its syntactic category. For ex- ample, a lexical transducer for French might relate the surface form veut to the lexical form vouloir+IndPr+SG+P3. In order to map between these two forms, the trans- ducer may contain a path like the one shown in Fig. 1. v o u 1 o i r +IndP+SG+P3 v e u t Fig. 1 Transducer path as well. as generation (vouloir+lndP+SG+P3 - veut ). Analysis and generation differ only with respect to the choice of the input side (surface or lexical). The transducer and the analysis/generation algorithm are the same in both directions. Other advantages that lexical transducers have over other methods of morpho

Citations

290	Regular models of phonological rule systems - Kaplan, Kay - 1994
126	PC-KIMMO: A two-level processor for Morphological Analysis - Antworth - 1990
43	Two-level rule compiler - Karttunen, Beesley - 1992
34	Finitestate lexicon compiler - Karttunen - 1993
4	Annie Zaenen - Sag, Kaplan, et al. - 1986
2	Pasi Tapanainen and Atro Voutilainen - Koskenniemi - 1992
1	I'C-KIMMO: a lwolevel processor for morpholo,@:al analysis. Smnmer institute of Linguistics - Antworth - 1990
1	1993).F'inile-Stah' l.exicon Compiler - Kartttmen, auri
1	l Iyuk-Chul and l,auri Karttunen - Kwon - 1994
1	and Anneli I,ieko - aaksonen, Kaino - 1988