Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Automata, Languages, and Machines
Automata, Languages, and Machines
Finite-state transducers in language and speech processing
Computational Linguistics
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
The objective of this work is to disambiguate transducers which have the following form: T = R o D and to be able to apply the determinization algorithm described in (Mohri, 1997). Our approach to disambiguating T = R o D consists first of computing the composition T and thereafter to disambiguate the transducer T. We will give an important consequence of this result that allows us to compose any number of transducers R with the transducer D, in contrast to the previous approach which consisted in first disambiguating transducers D and R to produce respectively D' and R', then computing T' = R' o D' where T' is unambiguous. We will present results in the case of a transducer D representing a dictionary and R representing phonological rules.