The DOI matches its Crossref record.
Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition
Abstract
A model for channels in which an input sequence can produce output sequences of varying length is described. An efficient computational procedure for calculating Pr\{Y\mid X\}is devised, whereX = x_1,x_2,\cdots,x_MandY = y_1,y_2,\cdots,y_Nare the input and output of the channel. A stack decoding algorithm for decoding on such channels is presented. The appropriate likelihood function is derived. Channels with memory are considered. Some applications to speech and character recognition are discussed.
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
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
(2003) · Cited by 1,680
Off-line cursive script word recognition
Bozinovic, R. M., & Srihari, S. N. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.23114 · Cited by 455
BLOG: Probabilistic Models with Unknown Objects
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0015 · Cited by 390
From WER and RIL to MER and WIL: improved evaluation measures for connected speech recognition
Morris, A. C., Maier, V., & Green, P. (2004) · Interspeech 2004 · doi:10.21437/interspeech.2004-668 · Cited by 290
Metadata
- Authors
- Bahl, L., & Jelinek, F.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1975-07
- Volume
- 21
- Issue
- 4
- Pages
- 404-411
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2157477135
- Cited by
- 196
- References
- 0
- FWCI
- 5.79
- 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: Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition. https://app.cochat.ai/papers/10.1109/tit.1975.1055419
- The paper
- Bahl, L., & Jelinek, F. (1975). Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1975.1055419
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.
