<?xml version="1.0" standalone="yes"?>
<Paper uid="P91-1032">
  <Title>NP -+ Det Nom \[ PN Det -+ Art \] NP's Nom -+ N I Nom PP J Adj Nom</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> Phrase-structure grammars are an effective representation for important syntactic and semantic aspects of natural languages, but are computationally too demanding for use as language models in real-time speech recognition. An algorithm is described that computes finite-state approximations for context-free grammars and equivalent augmented phrase-structure grammar formalisms.</Paragraph>
    <Paragraph position="1"> The approximation is exact for certain context-free grammars generating regular languages, including all left-linear and right-linear context-free grammars. The algorithm has been used to construct finite-state language models for limited-domain speech recognition tasks.</Paragraph>
  </Section>
class="xml-element"></Paper>