Sciweavers

Share
CICLING
2009
Springer

Guessers for Finite-State Transducer Lexicons

10 years 4 months ago
Guessers for Finite-State Transducer Lexicons
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we need to indicate their inflectional paradigm. We present a new generally applicable method for creating an entry generator, i.e. a paradigm guesser, for finite-state transducer lexicons. As a guesser tends to produce numerous suggestions, it is important that the correct suggestions be among the first few candidates. We prove some formal properties of the method and evaluate it on Finnish, English and Swedish full-scale transducer lexicons. We use the open-source Helsinki Finite-State Technology [1] to create finitestate transducer lexicons from existing lexical resources and automatically derive guessers for unknown words. The method has a recall of 82-87 % and a precision of 71-76 % for the three test languages. The model needs no external corpus and can therefore serve as a baseline.
Krister Lindén
Added 24 Nov 2009
Updated 24 Nov 2009
Type Conference
Year 2009
Where CICLING
Authors Krister Lindén
Comments (0)
books