<?xml version="1.0" standalone="yes"?>
<Paper uid="P95-1024">
  <Title>a Theory of Linearization in Head-Driven Phrase</Title>
  <Section position="5" start_page="178" end_page="178" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have argued for an approach to extraposition from smaller constituents that pays specific attention to the linear properties of the extraposition source, s To this end, we have proposed a more fine-grained typology of ways in which an order domain can be formed from smaller constituents. Crucially, we use relational constraints to define the interdependencies; hence our approach fits squarely into the paradigm in which grammars are viewed as sets of relational dependencies that has been advocated for instance in DSrre et al. (1992). Since the relational perspective also lies at the heart of computational formalisms such as CUF (DSrre and Eisele, 1991), the ideas presented here are expected to carry over into practical systems rather straightforwardly. We leave this task for future work.</Paragraph>
  </Section>
class="xml-element"></Paper>