Cited by 4,775Speech Recognition and SynthesisSpeech and Audio ProcessingBayesian Methods and Mixture Models

An introduction to hidden Markov models

Rabiner, L., Juang, B.·1986·IEEE ASSP Magazine

Abstract

The basic theory of Markov chains has been known to mathematicians and engineers for close to 80 years, but it is only in the past decade that it has been applied explicitly to problems in speech processing. One of the major reasons why speech models, based on Markov chains, have not been developed until recently was the lack of a method for optimizing the parameters of the Markov model to match observed signal patterns. Such a method was proposed in the late 1960's and was immediately applied to speech processing in several research institutions. Continued refinements in the theory and implementation of Markov modelling techniques have greatly enhanced the method, leading to a wide range of applications of these models. It is the purpose of this tutorial paper to give an introduction to the theory of Markov models, and to illustrate how they have been applied to problems in speech recognition.

Integrity signals

Registry

Crossref · 10.1109/massp.1986.1165342

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Rabiner, L., & Juang, B.
Affiliations
AT&T (United States) (US)
Venue
IEEE ASSP Magazine
Published
1986
Volume
3
Issue
1
Pages
4-16
ISSN
0740-7467 (ISSN-L)
OpenAlex
W2105594594
Cited by
4,775
References
15
Citations by year
2026: 73 · 2025: 137 · 2024: 174 · 2023: 186 · 2022: 211 · 2021: 222 · 2020: 198 · 2019: 213 · 2018: 208 · 2017: 238 · 2016: 225 · 2015: 200 · 2014: 190 · 2013: 177 · 2012: 181
FWCI
12.66
Type
journal article
Language
en
Open access
closed
Locations
IEEE ASSP Magazine (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Speech Recognition and Synthesis
  • Physical Sciences › Computer Science › Signal Processing › Speech and Audio Processing
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
Keywords
hidden Markov models, Markov chains, speech recognition, parameter estimation, speech models

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