Downing (1996): Numeral Classifier Systems: The Case of Japanese #
This file formalizes the semantic and pragmatic analysis of the Japanese numeral classifier system
in [Dow96]. A numeral classifier is a form that follows a numeral, readily co-occurs with a
noun denoting the enumerated referent, and denotes a natural unit of that referent whose
characteristics dictate its choice, which excludes standard measures, containers, partitions and
groupings (Chapter 1); the core inventory of Table 1.1 and the extended inventory of Table 1.2 are
Row, each row's entry a classifier of Japanese.Classifiers. The monograph evaluates two
universalist hypotheses (Chapter 5). Hypothesis 1, after [Den76], is that classifiers encode
categories defined by parameters of physical, functional and social interaction, Interaction, and
the core inventory conforms to this extent, core_interaction, though the monograph finds the
system adulterated with categories of little cultural weight. Hypothesis 2 is that classifiers
supplement the information carried by nouns; the capacity lies with the quality-classifiers, whose
deductive categories in the sense of [Hun77] are united by one or two physical properties and
crosscut noun categories, against the kind-classifiers of inductive categories, cohesion, the
animal and boat categories being inductive categories split by the deductive parameter of size,
sizeSplits. The morphemes serving as classifiers mostly bear independent senses related to their
categories along the six recurrent patterns of Table 5.2, MorphemeRelation; a seventh pattern
attested in other languages is absent from Japanese, relation_ne_sharedQuality, only the pairs of
the first pattern are clones of noun categories, and no quality-classifier is one,
quality_not_clone. Chapter 7 reconsiders [SS73]'s universal that classifier
languages lack obligatory plural marking and [Gre72]'s collective/singulative rationale for
it: Japanese common nouns are transnumeral and its pronouns and proper nouns inherently singular,
numberSystem, so plural marking is required on the latter and at most possible on the former,
Table 7.2, pluralMarking, and is monotone in the animacy of the referent and the referentiality of
the noun phrase, pluralMarking_mono_referent and pluralMarking_mono_head, a plurality split in
the sense of [SS74]; the same suffixes read as associative plurals on the singular heads
and as class plurals on the transnumeral ones, reading. Classifier phrases unitize and plural
markers maintain tracking-worthy individuals, so a group is introduced with the former and tracked
with the latter and never the reverse, Tracks. The anaphoric use of classifier phrases (Chapter 6)
and the four positions of the classifier phrase (Chapter 8) are represented by their examples.
Implementation notes #
The kind/quality distinction is derived from the semantic parameters of each row's category, coded
in Aikhenvald's vocabulary from the descriptions of the tables (Row.params): a parameter of
physical interaction, including [All77]'s quanta, is deductive, one of functional or social
interaction inductive, and a classifier is a quality-classifier when its parameters are all
deductive, a kind-classifier when all inductive, mixed when both, and general when it has none. The
morpheme-category relations of Table 5.2 are recorded for the rows the monograph assigns; the rows
it does not discuss are none, as are mai and tsu, which have no independent sense. Table 7.2
is the function pluralMarking and its regularities are proved by decide over the nine cells. The
frequency, breadth, acquisition, anaphoric-distance and construction-distribution counts of Chapters
3, 6 and 8 are corpus statistics and are not represented, nor are the taxonomic analyses of Chapter
4 or the history of Chapter 2.
References #
The inventory, Tables 1.1 and 1.2 #
The classifiers of the questionnaire, the twenty-seven every respondent used (Table 1.1) and the six a majority used (Table 1.2).
- tsu : Row
- nin : Row
- mei : Row
- hiki : Row
- tou : Row
- hon : Row
- mai : Row
- ko : Row
- satsu : Row
- tsubu : Row
- dai : Row
- kenBuilding : Row
- kenIncident : Row
- ki : Row
- ku : Row
- kyoku : Row
- mon : Row
- mune : Row
- seki : Row
- soku : Row
- soo : Row
- ten : Row
- toori : Row
- tsuu : Row
- kabu : Row
- shoku : Row
- teki : Row
- sao : Row
- wa : Row
- furi : Row
- zen : Row
- kyaku : Row
- rin : Row
Instances For
Equations
- Downing1996.instDecidableEqRow x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Downing1996.instReprRow = { reprPrec := Downing1996.instReprRow.repr }
Equations
- Downing1996.instReprRow.repr Downing1996.Row.tsu prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.tsu")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.nin prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.nin")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.mei prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.mei")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.hiki prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.hiki")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.tou prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.tou")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.hon prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.hon")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.mai prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.mai")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.ko prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.ko")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.satsu prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.satsu")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.tsubu prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.tsubu")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.dai prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.dai")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.kenBuilding prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.kenBuilding")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.kenIncident prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.kenIncident")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.ki prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.ki")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.ku prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.ku")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.kyoku prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.kyoku")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.mon prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.mon")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.mune prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.mune")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.seki prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.seki")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.soku prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.soku")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.soo prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.soo")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.ten prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.ten")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.toori prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.toori")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.tsuu prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.tsuu")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.kabu prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.kabu")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.shoku prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.shoku")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.teki prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.teki")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.sao prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.sao")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.wa prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.wa")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.furi prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.furi")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.zen prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.zen")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.kyaku prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.kyaku")).group prec✝
- Downing1996.instReprRow.repr Downing1996.Row.rin prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Row.rin")).group prec✝
Instances For
Equations
- Downing1996.instFintypeRow = { elems := { val := ↑Downing1996.Row.enumList, nodup := Downing1996.Row.enumList_nodup }, complete := Downing1996.instFintypeRow._proof_1 }
The fragment's entry for the row.
Equations
- Downing1996.Row.tsu.entry = Japanese.Classifiers.tsu
- Downing1996.Row.nin.entry = Japanese.Classifiers.nin
- Downing1996.Row.mei.entry = Japanese.Classifiers.mei
- Downing1996.Row.hiki.entry = Japanese.Classifiers.hiki
- Downing1996.Row.tou.entry = Japanese.Classifiers.tou
- Downing1996.Row.hon.entry = Japanese.Classifiers.hon
- Downing1996.Row.mai.entry = Japanese.Classifiers.mai
- Downing1996.Row.ko.entry = Japanese.Classifiers.ko
- Downing1996.Row.satsu.entry = Japanese.Classifiers.satsu
- Downing1996.Row.tsubu.entry = Japanese.Classifiers.tsubu
- Downing1996.Row.dai.entry = Japanese.Classifiers.dai
- Downing1996.Row.kenBuilding.entry = Japanese.Classifiers.kenBuilding
- Downing1996.Row.kenIncident.entry = Japanese.Classifiers.kenIncident
- Downing1996.Row.ki.entry = Japanese.Classifiers.ki
- Downing1996.Row.ku.entry = Japanese.Classifiers.ku
- Downing1996.Row.kyoku.entry = Japanese.Classifiers.kyoku
- Downing1996.Row.mon.entry = Japanese.Classifiers.mon
- Downing1996.Row.mune.entry = Japanese.Classifiers.mune
- Downing1996.Row.seki.entry = Japanese.Classifiers.seki
- Downing1996.Row.soku.entry = Japanese.Classifiers.soku
- Downing1996.Row.soo.entry = Japanese.Classifiers.soo
- Downing1996.Row.ten.entry = Japanese.Classifiers.ten
- Downing1996.Row.toori.entry = Japanese.Classifiers.toori
- Downing1996.Row.tsuu.entry = Japanese.Classifiers.tsuu
- Downing1996.Row.kabu.entry = Japanese.Classifiers.kabu
- Downing1996.Row.shoku.entry = Japanese.Classifiers.shoku
- Downing1996.Row.teki.entry = Japanese.Classifiers.teki
- Downing1996.Row.sao.entry = Japanese.Classifiers.sao
- Downing1996.Row.wa.entry = Japanese.Classifiers.wa
- Downing1996.Row.furi.entry = Japanese.Classifiers.furi
- Downing1996.Row.zen.entry = Japanese.Classifiers.zen
- Downing1996.Row.kyaku.entry = Japanese.Classifiers.kyaku
- Downing1996.Row.rin.entry = Japanese.Classifiers.rin
Instances For
The twenty-seven classifiers every respondent used.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The six further classifiers a majority of respondents used.
Equations
Instances For
The semantic parameters of the category each classifier names, coded in Aikhenvald's vocabulary from the descriptions of the tables; the general -tsu has none.
Equations
- Downing1996.Row.tsu.params = []
- Downing1996.Row.nin.params = [Classifier.Parameter.humanness]
- Downing1996.Row.mei.params = [Classifier.Parameter.humanness, Classifier.Parameter.register]
- Downing1996.Row.hiki.params = [Classifier.Parameter.animacy, Classifier.Parameter.size]
- Downing1996.Row.tou.params = [Classifier.Parameter.animacy, Classifier.Parameter.size]
- Downing1996.Row.hon.params = [Classifier.Parameter.shape]
- Downing1996.Row.mai.params = [Classifier.Parameter.shape]
- Downing1996.Row.ko.params = [Classifier.Parameter.shape]
- Downing1996.Row.satsu.params = [Classifier.Parameter.shape]
- Downing1996.Row.tsubu.params = [Classifier.Parameter.shape]
- Downing1996.Row.dai.params = [Classifier.Parameter.function]
- Downing1996.Row.kenBuilding.params = [Classifier.Parameter.function]
- Downing1996.Row.kenIncident.params = [Classifier.Parameter.function]
- Downing1996.Row.ki.params = [Classifier.Parameter.function]
- Downing1996.Row.ku.params = [Classifier.Parameter.function]
- Downing1996.Row.kyoku.params = [Classifier.Parameter.function]
- Downing1996.Row.mon.params = [Classifier.Parameter.function]
- Downing1996.Row.mune.params = [Classifier.Parameter.function]
- Downing1996.Row.seki.params = [Classifier.Parameter.function, Classifier.Parameter.size]
- Downing1996.Row.soku.params = [Classifier.Parameter.function, Classifier.Parameter.arrangement]
- Downing1996.Row.soo.params = [Classifier.Parameter.function, Classifier.Parameter.size]
- Downing1996.Row.ten.params = [Classifier.Parameter.function]
- Downing1996.Row.toori.params = [Classifier.Parameter.function]
- Downing1996.Row.tsuu.params = [Classifier.Parameter.function]
- Downing1996.Row.kabu.params = [Classifier.Parameter.function]
- Downing1996.Row.shoku.params = [Classifier.Parameter.quanta]
- Downing1996.Row.teki.params = [Classifier.Parameter.quanta]
- Downing1996.Row.sao.params = [Classifier.Parameter.shape]
- Downing1996.Row.wa.params = [Classifier.Parameter.animacy]
- Downing1996.Row.furi.params = [Classifier.Parameter.function]
- Downing1996.Row.zen.params = [Classifier.Parameter.function]
- Downing1996.Row.kyaku.params = [Classifier.Parameter.function]
- Downing1996.Row.rin.params = [Classifier.Parameter.shape, Classifier.Parameter.boundedness]
Instances For
-tsu is the one classifier whose category has no parameter.
Interaction parameters, Hypothesis 1 #
The three kinds of human interaction by which [Den76] has classifier categories defined.
- physical : Interaction
- functional : Interaction
- social : Interaction
Instances For
Equations
- Downing1996.instDecidableEqInteraction x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Downing1996.instReprInteraction = { reprPrec := Downing1996.instReprInteraction.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
The interaction a semantic parameter reflects: physical for the perceptual parameters, [All77]'s primary qualities, functional for use, and social for animacy and status; colour, which no classifier system encodes, reflects none.
Equations
- Downing1996.interaction Classifier.Parameter.shape = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.size = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.consistency = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.constitution = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.material = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.arrangement = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.boundedness = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.interioricity = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.direction = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.nature = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.quanta = some Downing1996.Interaction.physical
- Downing1996.interaction Classifier.Parameter.function = some Downing1996.Interaction.functional
- Downing1996.interaction Classifier.Parameter.animacy = some Downing1996.Interaction.social
- Downing1996.interaction Classifier.Parameter.humanness = some Downing1996.Interaction.social
- Downing1996.interaction Classifier.Parameter.sex = some Downing1996.Interaction.social
- Downing1996.interaction Classifier.Parameter.socialStatus = some Downing1996.Interaction.social
- Downing1996.interaction Classifier.Parameter.kinship = some Downing1996.Interaction.social
- Downing1996.interaction Classifier.Parameter.register = some Downing1996.Interaction.social
- Downing1996.interaction Classifier.Parameter.colour = none
Instances For
Hypothesis 1 on the core inventory: every core classifier but the general tsu encodes
a parameter of physical, functional or social interaction.
Kind-classifiers and quality-classifiers, Chapter 3 #
A deductive parameter unites a category by a single perceptual property.
Equations
Instances For
An inductive parameter names a category given by the world as humans use it.
Equations
Instances For
Equations
- Downing1996.instDecidablePredParameterDeductive p = id inferInstance
Equations
- Downing1996.instDecidablePredParameterInductive p = id inferInstance
Equations
- Downing1996.instDecidableEqCohesion x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
- Downing1996.instReprCohesion.repr Downing1996.Cohesion.kind prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Cohesion.kind")).group prec✝
Instances For
Equations
- Downing1996.instReprCohesion = { reprPrec := Downing1996.instReprCohesion.repr }
The cohesion of a classifier's category, read off its parameters: kind when all are inductive, quality when all are deductive, mixed when both kinds occur, and general when it has none.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The shape-based classifiers are quality-classifiers, the human and building classifiers
kind-classifiers, and tsu is the general classifier.
The pairs of core classifiers splitting one inductive category by size.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The classifier and noun systems, Hypothesis 2 #
The recurrent relations between a classifier's category and the independent sense of its morpheme, Table 5.2: the six patterns of Japanese, the seventh found in other languages, and the metonymic and metaphoric extensions of (4) and (5).
- identicalClass : MorphemeRelation
- partOfMembers : MorphemeRelation
- associatedAction : MorphemeRelation
- exemplar : MorphemeRelation
- creationAction : MorphemeRelation
- beneficiaryGoal : MorphemeRelation
- metonymic : MorphemeRelation
- metaphoric : MorphemeRelation
Instances For
Equations
- Downing1996.instDecidableEqMorphemeRelation x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
Equations
- One or more equations did not get rendered due to their size.
Instances For
The relation the monograph assigns to the fragment's entries, none for the entries it
does not discuss and for mai and tsu, which are confined to classifier use.
Equations
- Downing1996.relation Downing1996.Row.nin = some Downing1996.MorphemeRelation.identicalClass
- Downing1996.relation Downing1996.Row.kenIncident = some Downing1996.MorphemeRelation.identicalClass
- Downing1996.relation Downing1996.Row.ki = some Downing1996.MorphemeRelation.identicalClass
- Downing1996.relation Downing1996.Row.tou = some Downing1996.MorphemeRelation.partOfMembers
- Downing1996.relation Downing1996.Row.kyaku = some Downing1996.MorphemeRelation.partOfMembers
- Downing1996.relation Downing1996.Row.tsuu = some Downing1996.MorphemeRelation.associatedAction
- Downing1996.relation Downing1996.Row.furi = some Downing1996.MorphemeRelation.associatedAction
- Downing1996.relation Downing1996.Row.soku = some Downing1996.MorphemeRelation.beneficiaryGoal
- Downing1996.relation Downing1996.Row.zen = some Downing1996.MorphemeRelation.metonymic
- Downing1996.relation x✝ = none
Instances For
Only the first pattern makes a classifier a clone of a noun category, and no quality-classifier is one: the deductive categories crosscut the noun system.
Plural markers and classifier phrases as individuators, Chapter 7 #
Number is not an obligatory category of Japanese, and [Mar75]'s six devices for expressing it all carry other information; the classifier phrase and the plural suffixes -tachi, -ra share the task of individuating referents, (2).
The type of referent, in the order of the animacy hierarchy.
- inanimate : ReferentType
- animate : ReferentType
- human : ReferentType
Instances For
Equations
- Downing1996.instDecidableEqReferentType x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Downing1996.instReprReferentType = { reprPrec := Downing1996.instReprReferentType.repr }
Equations
- One or more equations did not get rendered due to their size.
Equations
- Downing1996.instDecidableEqNPHead x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
- Downing1996.instReprNPHead.repr Downing1996.NPHead.pronoun prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.NPHead.pronoun")).group prec✝
Instances For
Equations
- Downing1996.instReprNPHead = { reprPrec := Downing1996.instReprNPHead.repr }
Equations
- Downing1996.instFintypeNPHead = { elems := { val := ↑Downing1996.NPHead.enumList, nodup := Downing1996.NPHead.enumList_nodup }, complete := Downing1996.instFintypeNPHead._proof_1 }
The availability of a plural marker, from impossible to required.
- impossible : Availability
- rare : Availability
- possible : Availability
- required : Availability
Instances For
Equations
- Downing1996.instDecidableEqAvailability x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Downing1996.instReprAvailability = { reprPrec := Downing1996.instReprAvailability.repr }
Equations
- One or more equations did not get rendered due to their size.
Equations
Instances For
Equations
Instances For
Equations
Instances For
Equations
- Downing1996.instLinearOrderReferentType = LinearOrder.lift' Downing1996.ReferentType.rank ⋯
Equations
- Downing1996.instLinearOrderNPHead = LinearOrder.lift' Downing1996.NPHead.rank ⋯
Equations
- Downing1996.instLinearOrderAvailability = LinearOrder.lift' Downing1996.Availability.rank ⋯
Table 7.2: the availability of a plural marker by the type of the referent and the head of the noun phrase.
Equations
- Downing1996.pluralMarking x✝ Downing1996.NPHead.pronoun = Downing1996.Availability.required
- Downing1996.pluralMarking Downing1996.ReferentType.human Downing1996.NPHead.properNoun = Downing1996.Availability.required
- Downing1996.pluralMarking Downing1996.ReferentType.human Downing1996.NPHead.commonNoun = Downing1996.Availability.possible
- Downing1996.pluralMarking Downing1996.ReferentType.animate x✝ = Downing1996.Availability.rare
- Downing1996.pluralMarking Downing1996.ReferentType.inanimate x✝ = Downing1996.Availability.impossible
Instances For
Pronouns require a plural marker to refer to more than one individual, (10c).
Common nouns with inanimate referents reject plural markers, (8a) and (9b).
Plural marking is more available the higher the referent on the animacy hierarchy.
Plural marking is more available the more referential the head of the noun phrase.
The number system of a noun phrase head: common nouns are transnumeral, denoting the concept rather than individuals, while pronouns and proper nouns are inherently singular.
- transnumeral : NumberSystem
- singularPlural : NumberSystem
Instances For
Equations
- Downing1996.instDecidableEqNumberSystem x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Downing1996.instReprNumberSystem = { reprPrec := Downing1996.instReprNumberSystem.repr }
For human referents, a plural marker is required exactly on the inherently singular heads: the singular/plural subsystem within a transnumeral language.
What a plural suffix denotes: a group centred on the referent of its host, or a plurality of members of the host's category.
- associative : PluralReading
- classPlural : PluralReading
Instances For
Equations
- Downing1996.instDecidableEqPluralReading x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Downing1996.instReprPluralReading = { reprPrec := Downing1996.instReprPluralReading.repr }
-tachi and -ra are associative on pronouns and proper nouns, (11), and class plurals on common nouns, (12).
Equations
Instances For
The class plural arises exactly on the transnumeral heads, which context converts into singular expressions.
Against the hypothesis that classifiers and plural morphemes are in complementary distribution: the lexicon pairs a plural form and a classifier with one noun, as in (2b).
Equations
- Downing1996.instDecidableEqMention x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Downing1996.instReprMention = { reprPrec := Downing1996.instReprMention.repr }
Equations
- One or more equations did not get rendered due to their size.
- Downing1996.instReprMention.repr Downing1996.Mention.bare prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Downing1996.Mention.bare")).group prec✝
Instances For
A sequence of mentions of one group tracks it when no plural-marked mention precedes a classifier phrase: the classifier phrase unitizes on introduction and the plural marker maintains the individuated status, (16) and (23), and the reverse order is unattested.
Equations
- Downing1996.Tracks s = List.Pairwise (fun (a b : Downing1996.Mention) => ¬(a = Downing1996.Mention.pluralMarked ∧ b = Downing1996.Mention.classifierPhrase)) s
Instances For
Equations
- Downing1996.instDecidablePredListMentionTracks s = id inferInstance
The sequence of (16), a classifier phrase followed by plural-marked mentions, tracks, and its reverse does not.