<?xml version="1.0" standalone="yes"?>
<Paper uid="P83-1003">
  <Title>Crossed Serial Dependencies: i low-power parseable extension to GPSG</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
I. INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> There has been considerable interest in the community lately with the implications of crossed serial dependencies in e.g. Dutch subordinate clauses for non-transformational theories of grammar. Although context-free phrase structure grammars under the standard interpretations are weakly adequate to generate such languages as anb n, they are not capable of assigning the correct dependencies - that is, they are notstrongly adequate.</Paragraph>
    <Paragraph position="1"> In a recent paper (Bresnan Kaplsn Peters end Zaenen 1982) (hereafter BKPZ), a solution to the Dutch problem was presented in terms of LFG (Kaplan and Bresnan 1982), which is known to have considerably more than context-free power.</Paragraph>
    <Paragraph position="2"> (Steedman 1983) and (Joshi 1983) have also made proposals for solutions in terms of Steedman/Ades grammars and tree adjunction grammars (Ades and Steedman 1982; Joshi Levy and Yueh 1975). In this paper I present a minimal extension to the GPSC formalism (Gazdar 1981c) which also provides a solution. It induces structures for the relevant sentences which are non-trivially distinct from those in BKPZ, and which I argue are more appropriate. It appears, when suitably constrained, to be similar to Joshi's proposal in making only a small increment in power, being incapable, for instance, of analysing anbnc n with crossed dependencies. And it can easily be parsed by a small modification to the parsing mechanisms I have already developed for GPSG.</Paragraph>
  </Section>
class="xml-element"></Paper>