223 search results - page 4 / 45 » Constructing Lexical Transducers |
CICLING
2009
Springer
14 years 8 months ago
2009
Springer
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 ne...
COLING
2000
13 years 8 months ago
2000
A deterministic finite state transducer is a fast device for analyzing strings. It takes O(n) time to analyze a string of length n. In this paper, an application of this technique...
IJCM
2010
13 years 5 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
TAL
2010
Springer
13 years 5 months ago
2010
Springer
The lack of large-scale, freely available and durable lexical resources, and the consequences for NLP, is widely acknowledged but the attempts to cope with usual bottlenecks preven...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...