<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-2025">
  <Title>Funetor-Driven Natural Language Generation with Categorial-Unification Grammars</Title>
  <Section position="4" start_page="0" end_page="0" type="concl">
    <SectionTitle>
4. Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper we have argued t,hat a functor-driven generation algorithnl for categorial unification grammars leads to efficient natural language generation, if the algorithm incorporates Part,ee and Rooth's (1983) principle of minimal type assignment. In order to have minimal type assignment and still allow type-raising in rest.ricted contexts, we have adopted Wittenburg's (1986) idea of supercombina5 149 tors. Type-rMsing has been incorporated into the function application rule so that type-raising can only apply when some functor is looking for a type-raised argument. This use of supercombinators to achieve semantic compatibility generalizes Wittm&gt; burg's strictly syntactic application of these combin at ors.</Paragraph>
  </Section>
class="xml-element"></Paper>