Economy of description for single-valued transducers
Information and Computation
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Digital images and formal languages
Handbook of formal languages, vol. 3
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Finite-state transducers in language and speech processing
Computational Linguistics
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Efficient algorithms for testing the twins property
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
| Hi-index | 0.01 |
p-subsequential transducers are efficient finite-state transducers with p final outputs used in a variety of applications. Not all transducers admit equivalent p-subsequential transducers however. We briefly describe an existing generalized determinization algorithm for p- subsequential transducers and give the first characterization of p-subsequentiable transducers, transducers that admit equivalent p-subsequential transducers. Our characterization shows the existence of an efficient algorithm for testing p-subsequentiability. We have fully implemented the generalized determinization algorithm and the algorithm for testing p- subsequentiability. We report experimental results showing that these algorithms are practical in large-vocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, p-subsequentiability, and the twins property.