<?xml version="1.0" standalone="yes"?>
<Paper uid="P86-1010">
  <Title>PARSING A FREE-WORD ORDER LANGUAGE: WARLPIRI</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> Basing a parser on Government-Binding theory has led to a design that is quite different from traditional algorithms. 1 The parser presented here operates in two stages, lexical and syntactic. Each stage is carried out by the same parsing engine. The lexical parser projects each constituent lexical item (morpheme) according to information in its associated lexical entries. Lexical parsing is highly data-driven from entries in the lexicon, in keeping with GB. Lexical parses returned by the first stage are then handed over to the second stage, the syntactic parser, as input, where they are further projected and combined to form the final phrase marker.</Paragraph>
    <Paragraph position="1"> Before plunging into the parser itself, a sample Warlpiri sentence is presented. Following this, the theory of argument (i.e., NP) identification is given, in order to show how its substantive linguistic principles may be used directly in parsing. Both the lexicon and the other basic data structures are then discussed, followed by a description of the central algorithm, the parsing engine. Lexical phrase-markers produced by the parser for the words kur1 Johnson (1985} reports another design for analyzing discontinuous constituents; it is not grounded on any linguistic theory, however. duku and puntarni are then given. Finally, the syntactic phrase-marker for the sample sentence is presented. All the phrase-markers shown are slightly edited outputs of the implemented program.</Paragraph>
  </Section>
class="xml-element"></Paper>