• No results found

Semantic and pragmatic functions in Plains Cree syntax - List of figures

N/A
N/A
Protected

Academic year: 2021

Share "Semantic and pragmatic functions in Plains Cree syntax - List of figures"

Copied!
2
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl)

UvA-DARE (Digital Academic Repository)

Semantic and pragmatic functions in Plains Cree syntax

Wolvengrey, A.E.

Publication date

2011

Link to publication

Citation for published version (APA):

Wolvengrey, A. E. (2011). Semantic and pragmatic functions in Plains Cree syntax. LOT.

General rights

It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons).

Disclaimer/Complaints regulations

If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.

(2)

ix

List of Figures

Figure 1.1 Cree Language and Dialect Continuum ... 4

Figure 1.2 Algonquian Language Family ...7-8 Figure 1.3 Plains Cree Vowels ... 11

Figure 1.4 Word Formation Classification ... 23

Figure 1.5 Case-Marking Types ... 32

Figure 1.6 Identification of Participants in 1-, 2- and 3-Place Predications ... 35

Figure 1.7 Direct-Indirect versus Primary-Secondary Objects ... 35

Figure 2.1 Nominal Animacy Classification ... 56

Figure 2.2 VTA Paradigm Subsets ... 77

Figure 2.3 Traditional VTA Mixed Set Suffix Order ... 88

Figure 2.4 Revised VTA Mixed Set Suffix Order ... 88

Figure 2.5 Mixed Set Direct and Inverse ... 89

Figure 2.6 Hierarchical Disjunct Morphology in the VTA Direct ... 91

Figure 2.7 Third Person Set Direct and Inverse ... 95

Figure 2.8 Local Set Direct and Inverse ... 102

Figure 2.9 Speech Act Interaction ... 117

Figure 2.10 Direct-Inverse and the Algonquian Circle of Reference ... 118

Figure 2.11 Transitivity over Animacy ... 125

Figure 2.12 Animacy-based Nominal Classification ... 175

Figure 2.13 Animacy-based Verbal Classification ... 175

Figure 2.14 Cree Animacy-based Verb Classes ... 176

Figure 3.1 English and Plains Cree Voice ... 218

Figure 3.2 English and Cree Voice Example ... 218

Referenties

GERELATEERDE DOCUMENTEN

In my position as Science Librarian, I have been responsible for faculty liaison, collection development, reference and research and library instruction for my subject areas

If the number of surface species increases to three, for example CO(ads), OH(ads) and either free Pt sites or O(ads), two adsorption relaxations are needed, circuit 2L, in order

Against this complex contemporary social and cultural context, Tal-choom, as Korea’s popular theatre, exem­ plifies its current place and the future possibilities

But, above all, Bildung’s ideological force remains invisible (Gadamer’s "atmosphere breathed”) so that individuals fieely consent to its demands; its subjects, that is,

Once the combined sets containing only good data points are identified, classical estimation methods such as the least-squares method and the maximum likelihood method can be applied

This thesis reduces the paucity of Canadian research on sexual minorities by showing lesbian and bisexual women (among a sample of residential treatment clients) use certain drugs

The smoking ban policy of provincial health authorities was designed to address two issues: firstly, smoking within workplaces in DSRs in mental health and long term care continued

Following this direction, in order to develop a practical algorithm to construct suffix trees for input strings of any size, we need three essential steps to be efficient from an