A speaker-independent, syntax-directed, connected word recognition system based on hidden Markov models and level building
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In the last several years, a wide variety of techniques have been developed which make practical the implementation and development of large networks for recognizing connected sequences of words. Included among these techniques are efficient and accurate speech modeling methods (e.g., vector quantization, hidden Markov models) and efficient, optimal network search procedures (i.e., level building). In this paper we show how to integrate these techniques to give a speaker-independent, syntax-directed, connected word recognition system which requires only a modest amount of computation, and whose performance is comparable to that of previous recognizers requiring an order of magnitude more computation. In particular, the recognizer we studied was an airlines information and reservation system using a 129 word vocabulary, and a deterministic syntax (grammar) with 144 states, 450 state transitions, and 21 final states, generating more than 6 × 109sentences. An evaluation of the system, using six talkers each speaking 51 test sentences, yielded a sentence accuracy of about 75 percent resulting from a word accuracy of about 93 percent, for an average speaking rate of about 210 words per minute.
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
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Cited by
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Self-citationA Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition
RABINER, L. R. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50027-9 · Cited by 1,869
Self-citationContinuously variable duration hidden Markov models for automatic speech recognition
Levinson, S. E. (1986) · Computer Speech & Language · doi:10.1016/s0885-2308(86)80009-2 · Cited by 457
Self-citationGlobal 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
Metadata
- Authors
- Rabiner, L., & Levinson, S.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1985-06
- Volume
- 33
- Issue
- 3
- Pages
- 561-573
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2035789797
- Cited by
- 90
- References
- 1
- FWCI
- 2.56
- 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: A speaker-independent, syntax-directed, connected word recognition system based on hidden Markov models and level building. https://app.cochat.ai/papers/10.1109/tassp.1985.1164586
- The paper
- Rabiner, L., & Levinson, S. (1985). A speaker-independent, syntax-directed, connected word recognition system based on hidden Markov models and level building. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1985.1164586
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.