127 citations · 160 across the 10 of their papers we have counts for
10 papers
Generalization Bounds for Weighted Automata
Borja Balle, Mehryar Mohri
This paper studies the problem of learning weighted automata from a finite labeled training sample. We consider several general families of weighted automata defined in terms of th…
On the Disambiguation of Weighted Automata
Mehryar Mohri, Michael D. Riley
We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a deta…
Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton
Cyril Allauzen, Mehryar Mohri
The problem of computing the edit-distance between a string and a finite automaton arises in a variety of applications in computational biology, text processing, and speech recogni…
General Algorithms for Testing the Ambiguity of Finite Automata
Cyril Allauzen, Mehryar Mohri, Ashish Rastogi
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with -transitions. It gives an algorithm for testing th…
3-Way Composition of Weighted Finite-State Transducers
Cyril Allauzen, Mehryar Mohri
Composition of weighted transducers is a fundamental algorithm used in many applications, including for computing complex edit-distances between automata, or string kernels in mach…
Weighted Automata in Text and Speech Processing
Mehryar Mohri, Fernando Pereira, Michael Riley
Finite-state automata are a very effective tool in natural language processing. However, in a variety of applications and especially in speech precessing, it is necessary to consid…