Robust combination of neural networks and hidden markov models for speech recognition
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Acoustic modeling in state-of-the-art speech recognition systems usually relies on hidden Markov models (HMMs) with Gaussian emission densities. HMMs suffer from intrinsic limitations, mainly due to their arbitrary parametric assumption. Artificial neural networks (ANNs) appear to be a promising alternative in this respect, but they historically failed as a general solution to the acoustic modeling problem. This paper introduces algorithms based on a gradient-ascent technique for global training of a hybrid ANN/HMM system, in which the ANN is trained for estimating the emission probabilities of the states of the HMM. The approach is related to the major hybrid systems proposed by Bourlard and Morgan and by Bengio, with the aim of combining their benefits within a unified framework and to overcome their limitations. Several viable solutions to the "divergence problem"-that may arise when training is accomplished over the maximum-likelihood (ML) criterion-are proposed. Experimental results in speaker-independent, continuous speech recognition over Italian digit-strings validate the novel hybrid framework, allowing for improved recognition performance over HMMs with mixtures of Gaussian components, as well as over Bourlard and Morgan's paradigm. In particular, it is shown that the maximum a posteriori (MAP) version of the algorithm yields a 46.34% relative word error rate reduction with respect to standard HMMs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Davis, S., & Mermelstein, P. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163420 · Cited by 5,465 · cited 1×
“Spectral analysis of the speech signals (acquired at a sampling rate of 16 kHz) was accomplished over 20 ms Hamming windows having an overlap of 10 ms, in order to extract 8 mel frequency scaled cepstral coefficients(MFSCCs) [ 40 ] as well as the signal log-energy as acoustic features.”
MethodGlobal optimization of a neural network-hidden Markov model hybrid
Bengio, Y., De Mori, R., Flammia, G., & Kompe, R. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.125866 · Cited by 203
Cited by
Supervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
Automatic Speech Recognition: A Survey
Malik, M., Malik, M. K., Mehmood, K., & Makhdoom, I. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10073-7 · Cited by 358
“(cid:129) It is invariant to shift in time [17].”
BackgroundWang, S., Xiang, J., Zhong, Y., & Zhou, Y. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.12.027 · Cited by 269
Metadata
- Authors
- Trentin, E., & Gori, M.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2003-11
- Volume
- 14
- Issue
- 6
- Pages
- 1519-1531
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2166993553
- Cited by
- 81
- References
- 2
- FWCI
- 4.59
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust combination of neural networks and hidden markov models for speech recognition. https://app.cochat.ai/papers/10.1109/tnn.2003.820838
- The paper
- Trentin, E., & Gori, M. (2003). Robust combination of neural networks and hidden markov models for speech recognition. IEEE Transactions on Neural Networks. https://doi.org/10.1109/tnn.2003.820838
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.