Case in an Australian Language: Distribution of Case and Multiple Case Marking in Nyamal
MetadataShow full item record
© editorial matter and organization Andrej Malchukov and Andrew Spencer 2009, chapters their several authors 2009. All rights reserved. Nyamal is an Australian language of the Pama-Nyungan family, originally spoken in the Pilbara region of Western Australia. In Nyamal, as in many Australian languages, nominal suffixes serve a wide range of dependency-marking functions, which include but are not restricted to traditional 'case'. Nyamal has a very complex system of case marking. This complexity is due to its very strong tendency towards multiple case marking combined with variation in the case marking selected by arguments of different predicates, in different clause types, and by different patterns of case syncretism in different classes of nominals. Morphological coding conventions determine the distribution of case suffixes to constituents within a phrase or clause marked for case. Patterns of suffix distribution predicted by the use of case suffixes at different functional levels and by the rules of concord are modified by certain morphological sequence constraints. This article describes and exemplifies that complexity. It sets out the variables affecting the choice of case marking for arguments in clauses and describes the patterns of multiple case marking.
Showing items related by title, author, creator and subject.
Puglisi, Simon; Smyth, William; Turpin, A. (2007)In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, and especially in the last few ...
Chen, G.; Puglisi, Simon; Smyth, B. (2008)For 30 years the Lempel-Ziv factorization LZ x of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) ...
Puglisi, Simon; Smyth, William; Turpin, Andrew (2006)Recent advances in the asymptotic resource costs of pattern matching with compressed suffix arrays are attractive, but a key rival structure, the compressed inverted file, has been dismissed or ignored in papers presenting ...