Results 1  10
of
186
A completeness theorem for Kleene algebras and the algebra of regular events
 Information and Computation
, 1994
"... We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1 ..."
Abstract

Cited by 232 (27 self)
 Add to MetaCart
(Show Context)
We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1
Weighted finitestate transducers in speech recognition
 COMPUTER SPEECH & LANGUAGE
, 2002
"... We survey the use of weighted finitestate transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for hidden Markov models (HMMs), contextdependency, pronunciation dictionaries, grammars, and alternative recognition outputs. Furthermore, general tr ..."
Abstract

Cited by 186 (5 self)
 Add to MetaCart
(Show Context)
We survey the use of weighted finitestate transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for hidden Markov models (HMMs), contextdependency, pronunciation dictionaries, grammars, and alternative recognition outputs. Furthermore, general transducer operations combine these representations flexibly and efficiently. Weighted determinization and minimization algorithms optimize their time and space requirements, and a weight pushing algorithm distributes the weights along the paths of a weighted transducer optimally for speech recognition. As an example, we describe a North American Business News (NAB) recognition system built using these techniques that combines the HMMs, full crossword triphones, a lexicon of 40 000 words, and a large trigram grammar into a single weighted transducer that is only somewhat larger than the trigram word grammar and that runs NAB in realtime on a very simple decoder. In another example, we show that the same techniques can be used to optimize lattices for secondpass recognition. In a third example, we show how general automata operations can be used to assemble lattices from different recognizers to improve recognition performance.
On The Computational Power Of Neural Nets
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1995
"... This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal" function to a linear combination of the previous states of all units. We prove that one may simulate all Turing Mach ..."
Abstract

Cited by 168 (22 self)
 Add to MetaCart
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal" function to a linear combination of the previous states of all units. We prove that one may simulate all Turing Machines by such nets. In particular, one can simulate any multistack Turing Machine in real time, and there is a net made up of 886 processors which computes a universal partialrecursive function. Products (high order nets) are not required, contrary to what had been stated in the literature. Nondeterministic Turing Machines can be simulated by nondeterministic rational nets, also in real time. The simulation result has many consequences regarding the decidability, or more generally the complexity, of questions about recursive nets.
A Survey of Computational Complexity Results in Systems and Control
, 2000
"... The purpose of this paper is twofold: (a) to provide a tutorial introduction to some key concepts from the theory of computational complexity, highlighting their relevance to systems and control theory, and (b) to survey the relatively recent research activity lying at the interface between these fi ..."
Abstract

Cited by 162 (20 self)
 Add to MetaCart
The purpose of this paper is twofold: (a) to provide a tutorial introduction to some key concepts from the theory of computational complexity, highlighting their relevance to systems and control theory, and (b) to survey the relatively recent research activity lying at the interface between these fields. We begin with a brief introduction to models of computation, the concepts of undecidability, polynomial time algorithms, NPcompleteness, and the implications of intractability results. We then survey a number of problems that arise in systems and control theory, some of them classical, some of them related to current research. We discuss them from the point of view of computational complexity and also point out many open problems. In particular, we consider problems related to stability or stabilizability of linear systems with parametric uncertainty, robust control, timevarying linear systems, nonlinear and hybrid systems, and stochastic optimal control.
OpenFst: A general and efficient weighted finitestate transducer library. Implementation and Application of Automata
, 2007
"... Abstract. We describe OpenFst, an opensource library for weighted finitestate transducers (WFSTs). OpenFst consists of a C++ template library with efficient WFST representations and over twentyfive operations for constructing, combining, optimizing, and searching them. At the shellcommand level, ..."
Abstract

Cited by 98 (12 self)
 Add to MetaCart
(Show Context)
Abstract. We describe OpenFst, an opensource library for weighted finitestate transducers (WFSTs). OpenFst consists of a C++ template library with efficient WFST representations and over twentyfive operations for constructing, combining, optimizing, and searching them. At the shellcommand level, there are corresponding transducer file representations and programs that operate on them. OpenFst is designed to be both very efficient in time and space and to scale to very large problems. This library has key applications speech, image, and natural language processing, pattern and string matching, and machine learning. We give an overview of the library, examples of its use, details of its design that allow customizing the labels, states, and weights and the lazy evaluation of many of its operations. Further information and a download of the OpenFst library can be obtained from
SEMIRING FRAMEWORKS AND ALGORITHMS FOR SHORTESTDISTANCE PROBLEMS
, 2002
"... We define general algebraic frameworks for shortestdistance problems based on the structure of semirings. We give a generic algorithm for finding singlesource shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorit ..."
Abstract

Cited by 86 (20 self)
 Add to MetaCart
We define general algebraic frameworks for shortestdistance problems based on the structure of semirings. We give a generic algorithm for finding singlesource shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorithm can be used to solve efficiently classical shortest paths problems or to find the kshortest distances in a directed graph. It can be used to solve singlesource shortestdistance problems in weighted directed acyclic graphs over any semiring. We examine several semirings and describe some specific instances of our generic algorithms to illustrate their use and compare them with existing methods and algorithms. The proof of the soundness of all algorithms is given in detail, including their pseudocode and a full analysis of their running time complexity.
The Equality Problem for Rational Series With Multiplicities in the Tropical Semiring is Undecidable
, 1994
"... this paper that the equality problem for Mrational series over an alphabet with at least two letters is undecidable. ..."
Abstract

Cited by 63 (2 self)
 Add to MetaCart
this paper that the equality problem for Mrational series over an alphabet with at least two letters is undecidable.
Parameter Estimation for Probabilistic FiniteState Transducers
 Proc. of the Annual Meeting of the Association for Computational Linguistics
, 2002
"... Weighted finitestate transducers suffer from the lack of a training algorithm. Training is even harder for transducers that have been assembled via finitestate operations such as composition, minimization, union, concatenation, and closure, as this yields tricky parameter tying. We formulate a &qu ..."
Abstract

Cited by 53 (4 self)
 Add to MetaCart
(Show Context)
Weighted finitestate transducers suffer from the lack of a training algorithm. Training is even harder for transducers that have been assembled via finitestate operations such as composition, minimization, union, concatenation, and closure, as this yields tricky parameter tying. We formulate a "parameterized FST" paradigm and give training algorithms for it, including a general bookkeeping trick ("expectation semirings") that cleanly and efficiently computes expectations and gradients.
Weighted rational transductions and their application to human language processing
 In ARPA Workshop on Human Language Technology
, 1994
"... We present the concepts of weighted language, ~ansduction and automaton from algebraic automata theory as a general framework for describing and implementing decoding cascades in speech and language processing. This generality allows us to represent uniformly such information sources as pronunciat ..."
Abstract

Cited by 50 (9 self)
 Add to MetaCart
We present the concepts of weighted language, ~ansduction and automaton from algebraic automata theory as a general framework for describing and implementing decoding cascades in speech and language processing. This generality allows us to represent uniformly such information sources as pronunciation dictionaries, language models artd lattices, and to use uniform algorithms for building decoding stages and for optimizing and combining them. In particular, a single automata join algorithm can be used either to combine information sources such as a pronunciation dictionary and a contextdependency model during the construction of a decoder, or dynamically during the operation of the decoder. Applications to speech recognition and to Chinese text segmentation will be discussed. 1.