<?xml version="1.0" standalone="yes"?>
<Paper uid="H92-1082">
  <Title>An Efficient A* Stack Decoder Algorithm for Continuous Speech Recognition with a Stochastic Language Model*</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
ABSTRACT
</SectionTitle>
    <Paragraph position="0"> The stack decoder is an attractive algorithm for controlling the acoustic and language model matching in a continuous speech recognizer. A previous paper described a near-optimal admissible Viterbi A* search algorithm for use with non-cross-word acoustic models and no-grammar language models \[16\]. This paper extends this algorithm to include unigram language models and describes a modified version of the algorithm which includes the full (forward) decoder, cross-word acoustic models and longer-span language models. The resultant algorithm is not admissible, but has been demonstrated to have a low probability of search error and to be very efficient. null</Paragraph>
  </Section>
class="xml-element"></Paper>