Large-vocabulary continuous speech recognition: advances and applications
JL Gauvain, L Lamel - Proceedings of the IEEE, 2000 - ieeexplore.ieee.org
The past decade (1990-2000) has witnessed substantial advances in speech recognition
technology, which when combined with the increase in computational power and storage …
technology, which when combined with the increase in computational power and storage …
Subspace distribution clustering hidden Markov model
E Bocchieri, BKW Mak - IEEE transactions on Speech and …, 2001 - ieeexplore.ieee.org
Most contemporary laboratory recognizers require too much memory to run, and are too
slow for mass applications. One major cause of the problem is the large parameter space of …
slow for mass applications. One major cause of the problem is the large parameter space of …
[PDF][PDF] Data-parallel large vocabulary continuous speech recognition on graphics processors
Automatic speech recognition is a key technology for enabling rich human-computer
interaction in emerging applications. Hidden Markov Model (HMM) based recognition …
interaction in emerging applications. Hidden Markov Model (HMM) based recognition …
Product of Gaussians for speech recognition
MJF Gales, SS Airey - Computer Speech & Language, 2006 - Elsevier
Recently, there has been interest in the use of classifiers based on the product of experts
(PoE) framework. PoEs offer an alternative to the standard mixture of experts (MoE) …
(PoE) framework. PoEs offer an alternative to the standard mixture of experts (MoE) …
Efficient speech recognition using subvector quantization and discrete-mixture HMMs
S Tsakalidis, V Digalakis… - 1999 IEEE International …, 1999 - ieeexplore.ieee.org
This paper introduces a new form of observation distributions for hidden Markov models
(HMMs), combining subvector quantization and mixtures of discrete distributions. We …
(HMMs), combining subvector quantization and mixtures of discrete distributions. We …
Efficient speech recognition using subvector quantization and discrete-mixture HMMs
V Digalakis, S Tsakalidis, C Harizakis… - Computer Speech & …, 2000 - Elsevier
This paper introduces a new form of observation distributions for hidden Markov models
(HMMs), combining subvector quantization and mixtures of discrete distributions. Despite …
(HMMs), combining subvector quantization and mixtures of discrete distributions. Despite …
[PDF][PDF] Quantized HMMs for low footprint text-to-speech synthesis.
This paper proposes the use of Quantized Hidden Markov Models (QHMMs) for reducing the
footprint of conventional parametric HMM-based TTS system. Previously, this technique was …
footprint of conventional parametric HMM-based TTS system. Previously, this technique was …
Large vocabulary speech recognition based on statistical methods
JL Gauvain, F Lori Lamel LIMSI - Pattern recognition in speech …, 2003 - taylorfrancis.com
Speech recognition is concerned with converting the speech waveform, an acoustic signal,
into a sequence of words. Today's most practical approaches are based on a statistical …
into a sequence of words. Today's most practical approaches are based on a statistical …
An optimal Bhattacharyya centroid algorithm for Gaussian clustering with applications in automatic speech recognition
L Rigazio, B Tsakam, JC Junqua - 2000 IEEE International …, 2000 - ieeexplore.ieee.org
The problem of clustering Gaussian distributions can be effectively solved by standard
vector quantization algorithms where the metric is defined by the Bhattacharyya distance …
vector quantization algorithms where the metric is defined by the Bhattacharyya distance …
[PDF][PDF] Fast speaker adaptation
P Nguyen - Industrial Thesis Report, Institut Eurécom, 1998 - Citeseer
In typical speech recognition systems, there is a dichotomy between speaker independent
and speaker-dependent systems. While speaker-independent system are ready to be used …
and speaker-dependent systems. While speaker-independent system are ready to be used …