<?xml version="1.0" standalone="yes"?>
<Paper uid="P89-1028">
  <Title>TREE UNIFICATION GRAMMAR</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> There is a mind in uni~ca~on-based grammar formalisms towards using a single grammar stmctme to contain the phonological, syntactic and semantic information associated with a linguistic expression. Adopting'the terminology used by Pollard and Sag (1987), this grammar structure is called a sign. Grammar rules, guided by the syntactic information contained in signs, are used to derive signs associated with complex expressions from those of their constituent expressions. The relationship between the signs and the complex signs derived from grammar rule application can be expressed in derivationai structures. These structures both explicitly illustrate relations that are implicit in the syntax of the signs and express relations that are present in the grammar roles.</Paragraph>
    <Paragraph position="1"> Tree unification grammar (TUG) is a formalism which uses function-argument (FA) specif~ationa as its primary grammar structures. These specifications resemble partially specified derivational stmcmn~ of sign-based formalisms like head-driven phrase structure grammar (HPSG) (Pollard and Sag, 1987) and unification categorial grammar (UCG) (7_,eevat, Klein and Calder, 1987). TUG uses FA specifications as lexical entries and possesses a single grammar rule which combines these specifications to obtain a specification for the complex expression being analysed. The use of FA specifications allows generafisations that are often captured in grammar rules to be captured in the lexicon.</Paragraph>
  </Section>
class="xml-element"></Paper>