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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The usage of Recurrent Neural Network Language Models (RNNLMs) has allowed reaching significant improvements in Automatic Speech… 
2002
2002
This paper presents a new time/memory-efficient algorithm for the evaluation of state likelihoods in an HMM-based speech… 
2000
2000
A new language model for speech recognition is presented. The model develops hidden hierarchical syntactic-like structure… 
1999
1999
Multi-ply web forming stock jets directed through a slice from a single headbox into a forming zone between converging forming… 
1999
1999
In this paper we present a new method for improv-ing the throughput of an asynchronous stack search based speech recognition… 
1999
1999
This paper describes an algorithm for improvement of the speed of a time-asynchronous fast match, which is a part of a stack… 
1998
1998
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
The maximum a posteriori hypothesis is treated as the decoded truth in speech recognition. However, since the word recognition… 
1995
1995
A modified stack algorithm for VQ-based tree encoding on image compression applications is presented. The encoding process in… 
Highly Cited
1986
Highly Cited
1986
The Speech Recognition Group at IBM Research in Yorktown Heights has designed a real-time, isolated-utterance speech recognizer…