Sciweavers

656 search results - page 6 / 132
» Minimal non-convex words
Sort
View
CORR
2008
Springer
151views Education» more  CORR 2008»
14 years 8 months ago
Estimating the Lengths of Memory Words
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
Gusztáv Morvai, Benjamin Weiss
ACL
2009
14 years 7 months ago
Improving Automatic Speech Recognition for Lectures through Transformation-based Rules Learned from Minimal Data
We demonstrate that transformation-based learning can be used to correct noisy speech recognition transcripts in the lecture domain with an average word error rate reduction of 12...
Cosmin Munteanu, Gerald Penn, Xiaodan Zhu
IJAC
2007
116views more  IJAC 2007»
14 years 9 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
INTERSPEECH
2010
14 years 4 months ago
Data pruning for template-based automatic speech recognition
In this paper we describe and analyze a data pruning method in combination with template-based automatic speech recognition. We demonstrate the positive effects of polishing the t...
Dino Seppi, Dirk Van Compernolle
83
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Recent development of discriminative training using non-uniform criteria for cross-level acoustic modeling
In this paper, we extend our previous study on discriminative training using non-uniform criteria for speech recognition. The work will put emphasis on how the acoustic modeling i...
Chao Weng, Biing-Hwang Juang