<?xml version="1.0" standalone="yes"?>
<Paper uid="E91-1005">
  <Title>Long-Distance Scrambling and Tree Adjoining Grammars*</Title>
  <Section position="5" start_page="0" end_page="0" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have shown that long-distance scrambling, a syntactic phenomenon exhibited by German and some other languages, cannot be adequately described with a TAG. We have proposed two more powerful extensions of TAG: a variant of the well-studied MC-TAG, and a TAG formalism with free node order, FO-TAG.</Paragraph>
    <Paragraph position="1"> We have shown that both are descriptively adequate.</Paragraph>
    <Paragraph position="2"> The linguistic descriptions that these formalisms give rise to, however, are quite different, and they make different predictions about the nature of long-distance scrambling.</Paragraph>
    <Paragraph position="3"> Some key formal properties of the two formalisms are still under investigation, in particular the issues of polynomial parsability and generative power. We conjecture that FO-TAG and MC-TAG with dominance links (or some slight definitional variants of the two systems) are weakly equivalent to each other.</Paragraph>
  </Section>
class="xml-element"></Paper>