60 search results - page 1 / 12 » Disambiguation of Finite-State Transducers |
COLING
2002
13 years 4 months ago
2002
The objective of this work is to disambiguate transducers which have the following form: T = R D and to be able to apply the determinization algorithm described in (Mohri, 1997)....
ACL
2009
13 years 2 months ago
2009
This paper presents the first stochastic finite-state morphological parser for Turkish. The non-probabilistic parser is a standard finite-state transducer implementation of two-le...
ACL
1997
13 years 6 months ago
1997
This paper describes the conversion of a Hidden Markov Model into a sequential transducer that closely approximates the behavior of the stochastic model. This transformation is es...
WIA
2000
Springer
13 years 8 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
CICLING
2009
Springer
14 years 5 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...