Sciweavers

12 search results - page 1 / 3
» State-Identification Problems for Finite-State Transducers
Sort
View
NAACL
2010
13 years 2 months ago
Bayesian Inference for Finite-State Transducers
We describe a Bayesian inference algorithm that can be used to train any cascade of weighted finite-state transducers on end-toend data. We also investigate the problem of automat...
David Chiang, Jonathan Graehl, Kevin Knight, Adam ...
NAACL
2010
13 years 2 months ago
Formatting Time-Aligned ASR Transcripts for Readability
We address the problem of formatting the output of an automatic speech recognition (ASR) system for readability, while preserving wordlevel timing information of the transcript. O...
Maria Shugrina
EUROGP
2003
Springer
13 years 10 months ago
Evolving Finite State Transducers: Some Initial Explorations
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
Simon M. Lucas
COMCOM
1999
124views more  COMCOM 1999»
13 years 4 months ago
Minimizing the Cost of Fault Location when Testing from a Finite State Machine
If a test does not produce the expected output, the incorrect output may have been caused by an earlier state transfer failure. Ghedamsi and von Bochmann [1992] and Ghedamsi et al...
Robert M. Hierons