The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A Maximum Likelihood Approach to Continuous Speech Recognition
Abstract
Speech recognition is formulated as a problem of maximum likelihood decoding. This formulation requires statistical models of the speech production process. In this paper, we describe a number of statistical models for use in speech recognition. We give special attention to determining the parameters for such models from sparse data. We also describe two decoding methods, one appropriate for constrained artificial languages and one appropriate for more realistic decoding tasks. To illustrate the usefulness of the methods described, we review a number of decoding results that have been obtained with them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
Introduction to Theoretical Linguistics.
Robins, R. H., & Lyons, J. (1969) · The Philosophical Quarterly · doi:10.2307/2217864 · Cited by 1,640
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
Baum, L. E. (1972) · Medical Entomology and Zoology · Cited by 1,405
Interpolated estimation of Markov source parameters from sparse data
Jelinek, F. (1980) · Medical Entomology and Zoology · Cited by 823
Self-citationFast Sequential Decoding Algorithm Using a Stack
Jelinek, F. (1969) · IBM Journal of Research and Development · doi:10.1147/rd.136.0675 · Cited by 541
Self-citationThe DRAGON system--An overview
Baker, J. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162650 · Cited by 520
The HARPY speech recognition system
Lowerre, B. T. (1976) · Cited by 474
Bahl, L., & Jelinek, F. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055419 · Cited by 196
Self-citationContinuous speech recognition via centisecond acoustic states
Bakis, R. (1976) · The Journal of the Acoustical Society of America · doi:10.1121/1.2003011 · Cited by 175
Introduction to Theoretical Linguistics
Potter, S., & Lyons, J. C. (1970) · The Modern Language Review · doi:10.2307/3723537 · Cited by 137
Speech-understanding systems : final report of a study group
Newell, A. (2018) · KiltHub Repository · doi:10.1184/r1/6609830 · Cited by 85
Automatic recognition of continuously spoken sentences from a finite state grammer
Bahl, L. R., Baker, J., Cohen, P., Cole, A., Jelinek, F., Lewis, B., & Mercer, R. L. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1978.1170404 · Cited by 41
Self-citationBahl, L. R., Baker, J., Cohen, P., Dixon, N. R., Jelinek, F., Mercer, R. L., & Silverman, H. F. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1976.1170026 · Cited by 36
Self-citation
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
LLaMA: Open and Efficient Foundation Language Models
Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.-A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al. (2023) · arXiv · doi:10.48550/arxiv.2302.13971 · Cited by 4,602
(1992) · doi:10.5555/176313.176316 · Cited by 2,892
Self-citationAn empirical study of smoothing techniques for language modeling
Chen, S. F., & Goodman, J. (1999) · Computer Speech & Language · doi:10.1006/csla.1999.0128 · Cited by 2,066
A 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
Metadata
- Authors
- Bahl, L. R., Jelinek, F., & Mercer, R. L.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1983-03
- Volume
- PAMI-5
- Issue
- 2
- Pages
- 179-190
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W1966812932
- Cited by
- 1,212
- References
- 16
- FWCI
- 15.44
- 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
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.