## Finite-State Transducers (1997)

Venue: | in Speech Recognition. Computer Speech and Language |

Citations: | 68 - 18 self |

### BibTeX

@INPROCEEDINGS{Allauzen97finite-statetransducers,

author = {Cyril Allauzen and Mehryar Mohri},

title = {Finite-State Transducers},

booktitle = {in Speech Recognition. Computer Speech and Language},

year = {1997},

pages = {23--2}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. 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 psubsequential 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 psubsequentiability. 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. 1

### Citations

334 | Regular models of phonological rule systems
- Kaplan, Kay
- 1994
(Show Context)
Citation Context ...oth an input and an output symbol. Transducers have been used successfully to create complex systems in many applications such as text and language processing, speech recognition and image processing =-=[9,8,7,12,6]-=-. The time efficiency of such systems is substantially increased when subsequential transducers [15], i.e. finite-state transducers with deterministic input, are used. Subsequential machines can be ge... |

304 | Finite-state transducers in language and speech processing
- Mohri
- 1997
(Show Context)
Citation Context ...re transducers with deterministic input with p, (p ≥ 1), final output strings [10]. This generalization is necessary in many applications such as language processing to account for finite ambiguities =-=[11]-=-. Not all transducers admit equivalent p-subsequential transducers however. We present the first characterization of p-subsequentiable transducers, i.e. transducers that admit equivalent p-subsequenti... |

114 |
Transductions and Context-Free Languages. Teubner Studienbucher
- Berstel
- 1979
(Show Context)
Citation Context ...] to give a characterization of functional subsequentiable transducers. The decidability of the twins property ....sp-Subsequentiable Transducers 29 was also first proved by the same author (see also =-=[3]-=-). The first polynomialtime algorithm for testing the twins property was given by [16], this algorithm was later improved by [2]. More recently, we gave a more efficient algorithm for testing the twin... |

47 | On Some Applications of Finite-State Automata Theory to Natural Language Processing
- Mohri
- 1996
(Show Context)
Citation Context ...ucers with deterministic input, are used. Subsequential machines can be generalized to p-subsequential transducers which are transducers with deterministic input with p, (p ≥ 1), final output strings =-=[10]-=-. This generalization is necessary in many applications such as language processing to account for finite ambiguities [11]. Not all transducers admit equivalent p-subsequential transducers however. We... |

35 |
Digital images and formal languages
- Culik, Kari
- 1997
(Show Context)
Citation Context ...oth an input and an output symbol. Transducers have been used successfully to create complex systems in many applications such as text and language processing, speech recognition and image processing =-=[9,8,7,12,6]-=-. The time efficiency of such systems is substantially increased when subsequential transducers [15], i.e. finite-state transducers with deterministic input, are used. Subsequential machines can be ge... |

33 |
Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles
- Choffrut
- 1977
(Show Context)
Citation Context ...∈ P (q1,y,q1), π2 ∈ P (I, x, q2), c2 ∈ P (q2,y,q2), o[π1] −1 o[π2] =o[π1c1] −1 o[π2c2] (1) T has the twins property if any two siblings in T are twins. The twins property was originally introduced by =-=[4,5]-=- to give a characterization of functional subsequentiable transducers. The decidability of the twins property ....sp-Subsequentiable Transducers 29 was also first proved by the same author (see also [... |

22 |
Squaring transducers: An efficient procedure for deciding functionality and sequentiality
- Béal, Carton, et al.
(Show Context)
Citation Context ...iable Transducers 29 was also first proved by the same author (see also [3]). The first polynomialtime algorithm for testing the twins property was given by [16], this algorithm was later improved by =-=[2]-=-. More recently, we gave a more efficient algorithm for testing the twins property based on the general algorithm of composition of finite-state transducers and a new characterization of the twins pro... |

21 |
Economy of description for single-valued transducers
- Weber, Klemm
- 1995
(Show Context)
Citation Context ...ity of the twins property ....sp-Subsequentiable Transducers 29 was also first proved by the same author (see also [3]). The first polynomialtime algorithm for testing the twins property was given by =-=[16]-=-, this algorithm was later improved by [2]. More recently, we gave a more efficient algorithm for testing the twins property based on the general algorithm of composition of finite-state transducers a... |

20 |
Sur une variante des fonctions séquentielles
- Schützenberger
- 1977
(Show Context)
Citation Context ... applications such as text and language processing, speech recognition and image processing [9,8,7,12,6]. The time efficiency of such systems is substantially increased when subsequential transducers =-=[15]-=-, i.e. finite-state transducers with deterministic input, are used. Subsequential machines can be generalized to p-subsequential transducers which are transducers with deterministic input with p, (p ≥... |

8 | Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles. Theoretical Computer Science - Chorut - 1977 |

6 | Squaring transducers: An ecient procedure for deciding functionality and sequentiality - Beal, Carton, et al. - 2000 |

6 | Contributions a l'etude de quelques familles remarquables de fonctions rationnelles - Chorut |

4 |
The Replace Operator. In 33rd Annual Meeting of the Association for Computational Linguistics
- Karttunen
- 1995
(Show Context)
Citation Context ...oth an input and an output symbol. Transducers have been used successfully to create complex systems in many applications such as text and language processing, speech recognition and image processing =-=[9,8,7,12,6]-=-. The time efficiency of such systems is substantially increased when subsequential transducers [15], i.e. finite-state transducers with deterministic input, are used. Subsequential machines can be ge... |

2 | On the Determinizability of Weighted Automata and Transducers
- Allauzen, Mohri
- 2002
(Show Context)
Citation Context ... algorithm for testing the twins property based on the general algorithm of composition of finite-state transducers and a new characterization of the twins property in terms of combinatorics of words =-=[1]-=-. The following factorization lemma will be useful in several proofs. Lemma 1. Let T =(Σ, ∆, Q, I, F, E, λ, ρ) be a finite-state transducer, let π be a path from I to state p ∈ Q and π ′ a path from I... |

1 |
Contributions àl’étude de quelques familles remarquables de fonctions rationnelles
- Choffrut
- 1978
(Show Context)
Citation Context ... also be viewed as a generalization of the results known in the case of functional transducers: determinizable functional transducers are exactly those that admit equivalent subsequential transducers =-=[5]-=-. We generalize these results by relaxing the condition on functionality: determinizable transducers are exactly those that admit equivalent p-subsequential transducers and exactly those that admit th... |