<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-2029">
  <Title>Constraining Tree Adjoining Grammars by Unification</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> In a proposal, Vijay-Shanker and Joshi presented a definition for combining ttw two formalisms Tree Adjoining Grammars and PATR unification. The essential idea for that combination is the separation of the two recursion operations - adjoining and unification - to preserve all properties of both formalisms which is not desirable for natural language applications. In this paper, a definition for the integrated use of both processes is given and the remaining properties of the resulting formalism are discussed - especially weighing the appropriateness of this d~finition for natural language processing.</Paragraph>
  </Section>
class="xml-element"></Paper>