A Government-Binding Based Parser for Warlpiri, a Free-Word Order Language
Item
-
Title
-
en_US
A Government-Binding Based Parser for Warlpiri, a Free-Word Order Language
-
Creator
-
en_US
Kashket, Michael B.
-
Date
-
2004-10-20T20:10:50Z
-
Date Available
-
2004-10-20T20:10:50Z
-
Date Issued
-
en_US
1987-01-01
-
Identifier
-
en_US
AITR-993
-
Abstract
-
en_US
Free-word order languages have long posed significant problems for standard parsing algorithms. This thesis presents an implemented parser, based on Government-Binding (GB) theory, for a particular free-word order language, Warlpiri, an aboriginal language of central Australia. The words in a sentence of a free-word order language may swap about relatively freely with little effect on meaning: the permutations of a sentence mean essentially the same thing. It is assumed that this similarity in meaning is directly reflected in the syntax. The parser presented here properly processes free word order because it assigns the same syntactic structure to the permutations of a single sentence. The parser also handles fixed word order, as well as other phenomena. On the view presented here, there is no such thing as a "configurational" or "non-configurational" language. Rather, there is a spectrum of languages that are more or less ordered. The operation of this parsing system is quite different in character from that of more traditional rule-based parsing systems, e.g., context-free parsers. In this system, parsing is carried out via the construction of two different structures, one encoding precedence information and one encoding hierarchical information. This bipartite representation is the key to handling both free- and fixed-order phenomena. This thesis first presents an overview of the portion of Warlpiri that can be parsed. Following this is a description of the linguistic theory on which the parser is based. The chapter after that describes the representations and algorithms of the parser. In conclusion, the parser is compared to related work. The appendix contains a substantial list of test cases ??th grammatical and ungrammatical ??at the parser has actually processed.
-
Extent
-
10502478 bytes
-
7502547 bytes
-
Format
-
application/postscript
-
application/pdf
-
Language
-
en_US
-
Relation
-
en_US
AITR-993