<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1026">
  <Title>Separating Surface Order and Syntactic Relations in a Dependency Grammar</Title>
  <Section position="8" start_page="178" end_page="178" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented an approach to word order for DG which combines traditional notions (semantically motivated dependencies, topological fields) with contemporary techniques (logical description language, model-theoretic semantics). Word order domains are sets of partially ordered words associated with words. A word is contained in an order domain of its head, or may float into an order domain of a transitive head, resulting in a discontinuous dependency tree while retaining a projective order domain structure. Restrictions on the floating are expressed in a lexicalized fashion in terms of dependency relations. An important benefit is that the proposal is lexicalized without reverting to lexical ambiguity to represent order variation, thus profiting even more from the efficiency considerations discussed by Schabes et al. (1988).</Paragraph>
    <Paragraph position="1"> It is not yet clear what the generative capacity of such lexicalized discontinuous DGs is, but at least some index languages (such as anbnc n) can be characterized. Neuhaus &amp; BrSker (1997) have shown that recognition and parsing of such grammars is A/'7~-complete. A parser operating on the model structures is described in (Hahn et al., 1997).</Paragraph>
  </Section>
class="xml-element"></Paper>