815 search results - page 6 / 163 » Applications of Finite-State Transducers in Natural Language... |
WIA
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
FSMNLP
2008
Springer
13 years 9 months ago
2008
Springer
Weighted finite-state transducers have been used successfully in a variety of natural language processing applications, including speech recognition, speech synthesis, and machine ...
CICLING
2007
Springer
14 years 1 months ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
COLING
2002
13 years 7 months ago
2002
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
TAL
2004
Springer
14 years 25 days ago
2004
Springer
A simple, robust sliding-window part-of-speech tagger is presented and a method is given to estimate its parameters from an untagged corpus. Its performance is compared to a standa...