<?xml version="1.0" standalone="yes"?>
<Paper uid="P89-1002">
  <Title>A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semantically nonmonotonic grammars, yet unlike top-down methods, it also permits left-recursion. The enabling design feature of the algorithm is its implicit traversal of the analysis tree for the string being generated in a semantic-head-driven fashion.</Paragraph>
  </Section>
class="xml-element"></Paper>