Results 1 
2 of
2
FiniteState Transducers
 in Speech Recognition. Computer Speech and Language
, 1997
"... Abstract. psubsequential transducers are efficient finitestate transducers with p final outputs used in a variety of applications. Not all transducers admit equivalent psubsequential transducers however. We briefly describe an existing generalized determinization algorithm for psubsequential tran ..."
Abstract

Cited by 93 (20 self)
 Add to MetaCart
(Show Context)
Abstract. psubsequential transducers are efficient finitestate transducers with p final outputs used in a variety of applications. Not all transducers admit equivalent psubsequential transducers however. We briefly describe an existing generalized determinization algorithm for psubsequential transducers and give the first characterization of psubsequentiable transducers, transducers that admit equivalent psubsequential transducers. Our characterization shows the existence of an efficient algorithm for testing psubsequentiability. 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 largevocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finitestate transducers: determinizability in the sense of the generalized algorithm, psubsequentiability, and the twins property. 1
EditDistance of Weighted Automata
 In JeanMarc Champarnaud and Denis Maurel, editor, Seventh International Conference, CIAA 2002
, 2002
"... The editdistance of two strings is the minimal cost of a sequence of symbol insertions, deletions, or substitutions transforming one string into the other. The definition is used in various contexts to give a measure of the difference or similarity between two strings. This definition can be extend ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
The editdistance of two strings is the minimal cost of a sequence of symbol insertions, deletions, or substitutions transforming one string into the other. The definition is used in various contexts to give a measure of the difference or similarity between two strings. This definition can be extended to measure the similarity between two sets of strings. In particular, when these sets are represented by automata, their editdistance can be computed using the general algorithm of composition of weightes transducers comined with a singlesource shortestpaths algorithm.