<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1025">
  <Title>Deriving the Predicate-Argument Structure for a Free Word Order Language *</Title>
  <Section position="9" start_page="170" end_page="172" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> If an ordered representation of the PAS is assumed as many theories do nowadays, its derivation from the surface string requires that the category assignment for case cues be rich enough in word order and grammatical function information to correctly place the arguments in the PAS. This work shows that these categories and their types can be uniquely characterized in the lexicon and tightly controlled in parsing. Spurious ambiguity problem is kept under control by normal form parsing on the syntactic side with the use of labelled categories in the grammar.</Paragraph>
    <Paragraph position="1"> Thus, the PAS of a derivation can be determined uniquely even in the presence of type shifting. The same strategy can account for deriving the PAS in unbounded constructions and non-constituent coordination (Bozsahin, 1997).</Paragraph>
    <Paragraph position="2"> Parser's output (the combinatory form) is reduced to a PAS by normal order evaluation. Model-theoretic interpretation can proceed in parallel with derivations, or as a post-evaluation stage which takes the PAS as input. Quantification and scrambling in free word order languages interact in many ways, and future work will concentrate on this aspect of semantics.</Paragraph>
  </Section>
class="xml-element"></Paper>