Finite-State Language Processing
Finite-State Language Processing
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Extended Sequentialization of Transducers
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Finite-state transducers in language and speech processing
Computational Linguistics
Regular expressions for language engineering
Natural Language Engineering
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Compact representations by finite-state transducers
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Deciding sequentiability of finite-state transducers by finite-state pattern-matching
Theoretical Computer Science - Implementation and application automata
| Hi-index | 0.00 |
Sequentiality is a desirable property of finite state transducers: such transducers are optimal for time efficiency. Not all transducers are sequentiable. Sequentialization algorithms of finite state transducers do not recognize whether a transducer is sequentiable or not and simply do not ever halt when it is not. Choffrut proved that sequentiality of finite state transducers is decidable. B茅al et al. have proposed squaring to decide sequentiality. We propose a different procedure, which, with 驴-closure extension, is able to handle letter transducers with arbitrary 驴-ambiguities, too. Our algorithm is more economical than squaring, in terms of size. In different cases of non-sequentiability necessary and sufficient conditions of the ambiguity class of the transducer can be observed. These ambiguities can be mapped bijectively to particular basic patterns in the structure of the transducer. These patterns can be recognized, using finite state methods, in any transducer.