<?xml version="1.0" standalone="yes"?>
<Paper uid="C96-2103">
  <Title>Coordination in Tree Adjoining Grammars: Formalization and Implementation*</Title>
  <Section position="4" start_page="0" end_page="0" type="intro">
    <SectionTitle>
2 LTAG
</SectionTitle>
    <Paragraph position="0"> An LTAG is a set of trees (elementary lrees) which have at least one terminal symbol on its frontier called the anchor. Each node in the tree has a unique address obtained by applying a Gorn tree addressing scheme, shown in the tree ol(cooked) (Fig. 1). qYees can be rewritten using snbstitntion and adjunction. A history of these operations on elementary trees in the form of a derivation tree can be used to reconstruct the derivation of a string recognized by a LTAG. In Fig. 1, the tree fl(dried) adjoins into ~(beans) and trees ~(John) and a(beans) substitutes into a(cooked) to give a derivation tree for John cooked dried beans. Each node in the derivation tree is the name of an elementary tree. The labels on the edges denote the address in the parent node where a substitution or adjunction has occured.</Paragraph>
    <Paragraph position="1"> TAG G: a (cooked) o~ (J{}hn) o~(beans) fi (dried)</Paragraph>
    <Paragraph position="3"/>
  </Section>
class="xml-element"></Paper>