<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-2011">
  <Title>An Augmented Chart Data Structure with Efficient Word Lattice Parsing Scheme In Speech Recognition Applications</Title>
  <Section position="6" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6. Concluding Remarks
</SectionTitle>
    <Paragraph position="0"> In this paper, an augmented chart data structure fc,~' word lattice parsing is proposed, it is able to represent a~ad parse a lattice of words very efficiently without changing the fundamental principles, operations and applications of chart parsing. With this proposed approach, all possible constituents of the in!rot word lattice can be constructed and no constituent needs to be built more than once. This wilt reduce the computation complexity significantly especially when serious lexical ambiguity exists in the input word lattice. It is a general parsing scheme, in&lt;lependent of the granmmr formalisms and parsing strategies, thus can be easily extended to different applications. This augmented chart parsing scheme is therefore a very useful and efficient approach for speech recognition applications.</Paragraph>
  </Section>
class="xml-element"></Paper>