<?xml version="1.0" standalone="yes"?>
<Paper uid="P92-1044">
  <Title>A CCG APPROACH TO FREE WORD ORDER LANGUAGES</Title>
  <Section position="5" start_page="302" end_page="302" type="concl">
    <SectionTitle>
CONCLUSIONS
</SectionTitle>
    <Paragraph position="0"> What I have described above is work in progress in developing a CCG account of free word order languages. We introduced an uncurried functor notation which allowed a greater freedom in word order. Curried functors were used to handle certain restrictions in word order. A uniform analysis was given for the general linguistic facts involving both local and long distance scrambling. 1 have implemented a small grammar in Prolog to test out the ideas presented in this paper.</Paragraph>
    <Paragraph position="1"> Further research is necessary in the handling of long distance scrambling. The restriction placed on the composition rules in the last section should be based on syntactic and semantic features. Also, we may want to represent subordinate clauses with case-marking as type-raised functions over the matrix verb in order to distinguish them from clauses without case-marking.</Paragraph>
    <Paragraph position="2"> As a related area of research, prosody and pragmatic information must be incorporated into any account of free word order languages. Steedman (1990) has developed a categorial system which allows intonation to contribute information to the parsing process of CCGs. Further research is necessary to decide how best to use intonation and pragmatic information within a CCG model to interpret Turkish.</Paragraph>
  </Section>
class="xml-element"></Paper>