Skip to search formSkip to main contentSkip to account menu

Stack search

Stack search (also known as Stack decoding algorithm) is a search algorithm similar to beam search. It can be used to explore tree-structured search… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Beam searchNatural language processingSequential decodingStatistical parsing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Direct word graph rescoring using a* search and RNNLM
The usage of Recurrent Neural Network Language Models (RNNLMs) has allowed reaching significant improvements in Automatic Speech… 
2002
2002
EFFICIENT HIERARCHICAL LABELER ALGORITHM FOR GAUSSIAN LIK ELIHOODS COMPUTATION IN RESOURCE CONSTRAINED SPEECH RECOGNITION SY STEMS
This paper presents a new time/memory-efficient algorithm for the evaluation of state likelihoods in an HMM-based speech… 
2000
2000
Structured Language Modeling for Speech Recognition
A new language model for speech recognition is presented. The model develops hidden hierarchical syntactic-like structure… 
1999
1999
Reducing search complexity in low perplexity tasks
In this paper we present a new method for improving the throughput of an asynchronous stack search based speech recognition… 
1998
1998
Stack search—a graphical search model
Most text-searching user interfaces (HIS) are made of standard UI components arranged in text-based forms. This approach to… 
Highly Cited
1997
Highly Cited
1997
Word-based confidence measures as a guide for stack search in speech recognition
The maximum a posteriori hypothesis is treated as the decoded truth in speech recognition. However, since the word recognition… 
1997
1997
Techniques to achieve fast lexical access
Three techniques are proposed to speed up the search of the lexicon in large-vocabulary continuous speech recognition. Using a… 
1995
1995
Modified stack search algorithm for VQ-based tree encoding
A modified stack algorithm for VQ-based tree encoding on image compression applications is presented. The encoding process in… 
1995
1995
Algorithm for an A* stack search HMM word spotter
1994
1994
A decoding strategy using graph partitioning for continuous-speech recognition
Partitioned search (PS) of a language model results in dramatic complexity reduction, and improved recognition rates and noise… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)