The DOI matches its Crossref record.
A tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognition
Abstract
A novel tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognition is presented. The search consists of a forward time-synchronous trellis search and a backward time-asynchronous tree search. The Viterbi algorithm is used for recording the scores of all partial paths in a trellis time synchronously. Then a backward A* algorithm based tree search is used to extend partial paths time asynchronously. Extended partial paths in the backward tree search are rank ordered in a stack by their corresponding best possible scores of the remaining paths which are prerecorded in the forward trellis path map. In each path growing cycle, the current best partial path, which is at the top of the stack, is extended by the best possible one arc (word) extension. The tree-trellis search is different from the traditional time synchronous Viterbi search in its ability to find not just the best but the N best paths of different word content.>
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
Interacting with computers by voice: automatic speech recognition and synthesis
O'Shaughnessy, D. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.817117 · Cited by 132
Metadata
- Authors
- Soong, F. K., & Huang, E.-F.
- Venue
- [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing
- Publisher
- IEEE
- Published
- 1991
- Pages
- 705-708 vol.1
- ISSN
- 1520-6149 (ISSN-L)
- OpenAlex
- W2036102925
- Cited by
- 189
- References
- 0
- FWCI
- 11.49
- Type
- conference paper
- 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 tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognition. https://app.cochat.ai/papers/10.1109/icassp.1991.150437
- The paper
- Soong, F. K., & Huang, E.-F. (1991). A tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognition. [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/icassp.1991.150437
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.