The DOI matches its Crossref record.
A word graph algorithm for large vocabulary continuous speech recognition
Abstract
Abstract This paper describes a method for the construction of a word graph (or lattice) for large vocabulary, continuous speech recognition. The advantage of a word graph is that a fairly good degree of decoupling between acoustic recognition at the 10-ms level and the final search at the word level using a complicated language model can be achieved. The word graph algorithm is obtained as an extension of the one-pass beam search strategy using word dependent copies of the word models or lexical trees. The method has been tested successfully on the 20 000-word NAB'94 task (American English, continuous speech, 20 000 words, speaker independent) and compared with the integrated method. The experiments show that the word graph density can be reduced to an average number of about 10 word hypotheses, i.e. word edges in the graph, per spoken word with virtually no loss in recognition performance.
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
HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units
Hsu, W.-N., Bolte, B., Tsai, Y.-H. H., Lakhotia, K., Salakhutdinov, R., & Mohamed, A. (2021) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2021.3122291 · Cited by 2,983
Survey on speech emotion recognition: Features, classification schemes, and databases
El Ayadi, M., Kamel, M. S., & Karray, F. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.020 · Cited by 2,073
Introduction to Arabic Natural Language Processing
Habash, N. Y. (2010) · Synthesis Lectures on Human Language Technologies · doi:10.1007/978-3-031-02139-8 · Cited by 753
The Application of Hidden Markov Models in Speech Recognition
Gales, M., & Young, S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981219 · Cited by 557
Confidence measures for large vocabulary continuous speech recognition
Wessel, F., Schluter, R., Macherey, K., & Ney, H. (2001) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.906002 · Cited by 427
Self-citation
Metadata
- Authors
- Ortmanns, S., Ney, H., & Aubert, X.
- Venue
- Computer Speech & Language
- Publisher
- Elsevier BV
- Published
- 1997-01
- Volume
- 11
- Issue
- 1
- Pages
- 43-72
- ISSN
- 0885-2308 (ISSN-L)
- OpenAlex
- W2164579587
- Cited by
- 399
- References
- 0
- FWCI
- 17.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: A word graph algorithm for large vocabulary continuous speech recognition. https://app.cochat.ai/papers/10.1006/csla.1996.0022
- The paper
- Ortmanns, S., Ney, H., & Aubert, X. (1997). A word graph algorithm for large vocabulary continuous speech recognition. Computer Speech & Language. https://doi.org/10.1006/csla.1996.0022
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.