ten Wolde (2023): The English Binominal Noun Phrase: A Cognitive-Functional Approach

This file formalizes ten Wolde's account of the English of-binominal as a grammaticalization path from the prototypical N+PP (the hell of his own invention) through the head-classifier (a hell of loneliness) and the evaluative binominal noun phrase (a hell of a hotel) to the evaluative modifier (a hell of a man) and the binominal intensifier (a hell of a large sum) (Stage). The features of the book's two overview tables hold over intervals of the path, with one exception (ordConnected_span_iff): the second determiner is lost in the head-classifier and reappears in the evaluative binominal, which the book explains by inheritance from the N+PP, and which the network derives (inherited_secondDeterminer). A feature that holds over an interval is never lost once gained if it holds at the last stage (isUpperSet_span_of_top_mem), and the features together tell every two stages apart (profile_injective).

Every first noun of the case studies and of the corpus study is attested at all stages below the ones it has reached (isLowerSet_stages). In the constructional network every later stage inherits from the N+PP mother node, the horizontal metaphorical links are the covering relation of the path (metaphorical_iff_covBy), and the step onto the evaluative stages is a subjectification in Traugott's sense.

Implementation notes

• The spans of the diagnostics are read off the feature rows of Tables 3.2 and 4.2, the path off Figure 6.1, the semantic classes off Table 2.1, the attestations off Figures 5.1 and 5.2 and the summary of chapter 6, and the links off the network figures of chapter 8.
• A diagnostic is the set of stages at which it holds. The second determiner of the N+PP is an open determiner slot, which is counted here as marking number.
• A noun records the pseudo-partitive separately from its stages. Figure 6.1 draws that construction as an optional detour between the head-classifier and the evaluative binominal, not as a stage of the path.

References

• [tW23]
• [Tra10a]

The path

inductive TenWolde2023.Stage : Type

The constructions on the grammaticalization path, from the most lexical to the most grammaticalized.

• nPP : Stage

  The first noun denotes a referent and the prepositional phrase ascribes a property to it, as in the hell of his own invention.

• headClassifier : Stage

  The second noun classifies the type or material of the first, as in a hell of loneliness.

• evaluative : Stage

  The first noun ascribes an evaluative property to the referent of the second, as in a hell of a hotel.

• evaluativeModifier : Stage

  The chunk [N₁ of a] is a modifier evaluating the second noun, as in a hell of a man.

• binominalIntensifier : Stage

  The chunk [N₁ of a] intensifies a following adjective or quantifier, as in a hell of a large sum.

@[instance_reducible]

instance TenWolde2023.instDecidableEqStage : DecidableEq Stage

Equations

• TenWolde2023.instDecidableEqStage x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[instance_reducible]

instance TenWolde2023.instFintypeStage : Fintype Stage

Equations

• TenWolde2023.instFintypeStage = { elems := { val := ↑TenWolde2023.Stage.enumList, nodup := TenWolde2023.Stage.enumList_nodup }, complete := TenWolde2023.instFintypeStage._proof_1 }

@[instance_reducible]

instance TenWolde2023.instReprStage : Repr Stage

Equations

• TenWolde2023.instReprStage = { reprPrec := TenWolde2023.instReprStage.repr }

def TenWolde2023.instReprStage.repr : Stage → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.
• TenWolde2023.instReprStage.repr TenWolde2023.Stage.nPP prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "TenWolde2023.Stage.nPP")).group prec✝

@[instance_reducible]

instance TenWolde2023.instLinearOrderStage : LinearOrder Stage

The stages are ordered as they are listed.

Equations

• TenWolde2023.instLinearOrderStage = LinearOrder.lift' TenWolde2023.Stage.ctorIdx TenWolde2023.instLinearOrderStage._proof_1

@[instance_reducible]

instance TenWolde2023.instBoundedOrderStage : BoundedOrder Stage

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Stage.path : List Stage

The path, from the first stage to the last.

Equations

• One or more equations did not get rendered due to their size.

theorem TenWolde2023.Stage.path_isChain : List.IsChain (fun (x1 x2 : Stage) => x1 ⋖ x2) path

Each stage of the path is the immediate successor of the one before it.

Diagnostics

inductive TenWolde2023.Diagnostic : Type

The features that separate the constructions in the book's overview tables.

• ofMeaningful : Diagnostic

  of has prepositional meaning, such as 'out of', 'with' or 'from'.

• ofOmissible : Diagnostic

  of can be left out or fused, where elsewhere it is mandatory.

• det₁Omissible : Diagnostic

  The first determiner can be absent.

• det₂ : Diagnostic

  There is a second determiner.

• det₂Number : Diagnostic

  The second determiner marks number.

• n₁Head : Diagnostic

  The first noun is the semantic, syntactic and discourse head.

• n₂SyntacticHead : Diagnostic

  The second noun is the syntactic head, beyond being the semantic and discourse head.

• n₁Evaluative : Diagnostic

  The first noun ascribes an evaluative property to the second or evaluates its referent.

• chunk : Diagnostic

  [N₁ of a] functions as a unit, a modifier or an intensifier.

• det₁ScopeN₁ : Diagnostic

  The first determiner is selected by the first noun and does not scope over the whole.

• ofPhraseMoves : Diagnostic

  The of-phrase can be moved and coordinated.

• n₁Plural : Diagnostic

  The first noun can be plural.

• n₁FullModification : Diagnostic

  The first noun is modified without restriction to a limited set of modifiers.

• n₁Modification : Diagnostic

  The first noun can be modified at all.

• strictAgreement : Diagnostic

  The two nouns agree in number without exception.

• agreement : Diagnostic

  The two nouns agree in number at least as a rule.

• n₂CountOnly : Diagnostic

  The second noun must be a count or collective noun.

@[instance_reducible]

instance TenWolde2023.instDecidableEqDiagnostic : DecidableEq Diagnostic

Equations

• TenWolde2023.instDecidableEqDiagnostic x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[instance_reducible]

instance TenWolde2023.instFintypeDiagnostic : Fintype Diagnostic

Equations

• One or more equations did not get rendered due to their size.

@[instance_reducible]

instance TenWolde2023.instReprDiagnostic : Repr Diagnostic

Equations

• TenWolde2023.instReprDiagnostic = { reprPrec := TenWolde2023.instReprDiagnostic.repr }

def TenWolde2023.instReprDiagnostic.repr : Diagnostic → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Diagnostic.span : Diagnostic → Set Stage

The stages at which a diagnostic holds.

Equations

• TenWolde2023.Diagnostic.ofMeaningful.span = Set.Iic TenWolde2023.Stage.nPP
• TenWolde2023.Diagnostic.ofPhraseMoves.span = Set.Iic TenWolde2023.Stage.nPP
• TenWolde2023.Diagnostic.n₁Head.span = Set.Iic TenWolde2023.Stage.headClassifier
• TenWolde2023.Diagnostic.det₁ScopeN₁.span = Set.Iic TenWolde2023.Stage.headClassifier
• TenWolde2023.Diagnostic.n₁Plural.span = Set.Iic TenWolde2023.Stage.evaluative
• TenWolde2023.Diagnostic.n₁FullModification.span = Set.Iic TenWolde2023.Stage.evaluative
• TenWolde2023.Diagnostic.n₁Modification.span = Set.Iic TenWolde2023.Stage.evaluativeModifier
• TenWolde2023.Diagnostic.n₁Evaluative.span = Set.Ici TenWolde2023.Stage.evaluative
• TenWolde2023.Diagnostic.det₁Omissible.span = Set.Ici TenWolde2023.Stage.evaluativeModifier
• TenWolde2023.Diagnostic.n₂SyntacticHead.span = Set.Ici TenWolde2023.Stage.evaluativeModifier
• TenWolde2023.Diagnostic.chunk.span = Set.Ici TenWolde2023.Stage.evaluativeModifier
• TenWolde2023.Diagnostic.ofOmissible.span = Set.Ici TenWolde2023.Stage.binominalIntensifier
• TenWolde2023.Diagnostic.strictAgreement.span = Set.Icc TenWolde2023.Stage.evaluative TenWolde2023.Stage.evaluative
• TenWolde2023.Diagnostic.agreement.span = Set.Icc TenWolde2023.Stage.evaluative TenWolde2023.Stage.evaluativeModifier
• TenWolde2023.Diagnostic.n₂CountOnly.span = Set.Icc TenWolde2023.Stage.evaluative TenWolde2023.Stage.evaluativeModifier
• TenWolde2023.Diagnostic.det₂.span = {TenWolde2023.Stage.nPP} ∪ Set.Ici TenWolde2023.Stage.evaluative
• TenWolde2023.Diagnostic.det₂Number.span = {TenWolde2023.Stage.nPP, TenWolde2023.Stage.evaluative}

@[instance_reducible]

instance TenWolde2023.instDecidablePredStageMemSetSpan (d : Diagnostic) : DecidablePred fun (x : Stage) => x ∈ d.span

Equations

• One or more equations did not get rendered due to their size.

theorem TenWolde2023.ordConnected_span_iff (d : Diagnostic) : d.span.OrdConnected ↔ d ≠ Diagnostic.det₂ ∧ d ≠ Diagnostic.det₂Number

Every diagnostic but those of the second determiner holds over a contiguous span of the path. The head-classifier has no second determiner, while the N+PP before it and the evaluative binominal after it do.

theorem TenWolde2023.isUpperSet_span_of_top_mem {d : Diagnostic} (hd : d.span.OrdConnected) (h : ⊤ ∈ d.span) : IsUpperSet d.span

A feature of the most grammaticalized stage that holds over a contiguous span is never lost once gained.

theorem TenWolde2023.isLowerSet_span_of_bot_mem {d : Diagnostic} (hd : d.span.OrdConnected) (h : ⊥ ∈ d.span) : IsLowerSet d.span

A feature of the most lexical stage that holds over a contiguous span is never regained once lost.

theorem TenWolde2023.strictAgreement_span : Diagnostic.strictAgreement.span = {Stage.evaluative}

Number agreement between the nouns is transient, arising with the evaluative binominal and already weakened at the next stage.

theorem TenWolde2023.n₂CountOnly_not_upper_not_lower : ¬IsUpperSet Diagnostic.n₂CountOnly.span ∧ ¬IsLowerSet Diagnostic.n₂CountOnly.span

The restriction of the second noun to count nouns is transient, arising with the evaluative binominal and lifted again at the intensifier.

theorem TenWolde2023.n₁Head_span_compl : Diagnostic.n₁Head.spanᶜ = Diagnostic.n₁Evaluative.span

The head switches to the second noun exactly where the first noun becomes evaluative.

theorem TenWolde2023.n₁Plural_span_compl : Diagnostic.n₁Plural.spanᶜ = Diagnostic.chunk.span

The chunk [N₁ of a] forms exactly where the first noun stops inflecting.

def TenWolde2023.Stage.profile (s : Stage) : Finset Diagnostic

The diagnostics that hold at a stage.

Equations

• s.profile = {d : TenWolde2023.Diagnostic | s ∈ d.span}

theorem TenWolde2023.profile_injective : Function.Injective Stage.profile

The diagnostics tell every two stages apart.

First nouns

inductive TenWolde2023.SemanticClass : Type

The semantic classes of first nouns.

• inanimate : SemanticClass

  Inanimate concrete nouns such as cake, nub, breeze and husk.

• animate : SemanticClass

  Animate nouns such as beast, snake and whale.

• abstract : SemanticClass

  Abstract nouns, among them mythical beings and expletives, such as hell and bitch.

@[instance_reducible]

instance TenWolde2023.instDecidableEqSemanticClass : DecidableEq SemanticClass

Equations

• TenWolde2023.instDecidableEqSemanticClass x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[instance_reducible]

instance TenWolde2023.instReprSemanticClass : Repr SemanticClass

Equations

• TenWolde2023.instReprSemanticClass = { reprPrec := TenWolde2023.instReprSemanticClass.repr }

def TenWolde2023.instReprSemanticClass.repr : SemanticClass → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

structure TenWolde2023.Noun : Type

A first noun with the constructions it is attested in.

• semanticClass : SemanticClass
• stages : Finset Stage

  The stages of the path the noun is attested at.

• pseudoPartitive : Bool

  Whether the noun has pseudo-partitive uses, as in a hell of microwaves.

• fused : Option String

  The orthographically reduced form of [N₁ of a], if there is one.

@[instance_reducible]

instance TenWolde2023.instDecidableEqNoun : DecidableEq Noun

Equations

• TenWolde2023.instDecidableEqNoun = TenWolde2023.instDecidableEqNoun.decEq

def TenWolde2023.instDecidableEqNoun.decEq (x✝ x✝¹ : Noun) : Decidable (x✝ = x✝¹)

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Noun.hell : Noun

The case-study noun hell is attested at every stage and fuses to helluva.

Equations

• TenWolde2023.Noun.hell = { semanticClass := TenWolde2023.SemanticClass.abstract, stages := Finset.univ, pseudoPartitive := true, fused := some "helluva" }

def TenWolde2023.Noun.beast : Noun

The case-study noun beast is attested at every stage and has no pseudo-partitive uses.

Equations

• TenWolde2023.Noun.beast = { semanticClass := TenWolde2023.SemanticClass.animate, stages := Finset.univ, pseudoPartitive := false }

def TenWolde2023.Noun.cake : Noun

The case-study noun cake is attested up to the evaluative modifier.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Noun.whale : Noun

The noun whale is attested at every stage and fuses to whaleuva.

Equations

• TenWolde2023.Noun.whale = { semanticClass := TenWolde2023.SemanticClass.animate, stages := Finset.univ, pseudoPartitive := false, fused := some "whaleuva" }

def TenWolde2023.Noun.bitch : Noun

The noun bitch is attested at every stage, at the intensifier by a single token.

Equations

• TenWolde2023.Noun.bitch = { semanticClass := TenWolde2023.SemanticClass.abstract, stages := Finset.univ, pseudoPartitive := false }

def TenWolde2023.Noun.nub : Noun

The noun nub is attested up to the evaluative binominal.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Noun.breeze : Noun

The noun breeze is attested up to the evaluative binominal.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Noun.husk : Noun

The noun husk is attested up to the evaluative binominal.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Noun.snake : Noun

The noun snake is animate and yet has pseudo-partitive uses.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Noun.caseStudies : List Noun

The nouns of the three case studies.

Equations

• TenWolde2023.Noun.caseStudies = [TenWolde2023.Noun.cake, TenWolde2023.Noun.beast, TenWolde2023.Noun.hell]

def TenWolde2023.Noun.all : List Noun

The nouns of the case studies and of the corpus study.

Equations

• One or more equations did not get rendered due to their size.

theorem TenWolde2023.isLowerSet_stages (n : Noun) : n ∈ Noun.all → IsLowerSet ↑n.stages

A first noun attested at a stage is attested at every earlier stage.

theorem TenWolde2023.pseudoPartitive_of_inanimate (n : Noun) : n ∈ Noun.all → n.semanticClass = SemanticClass.inanimate → n.pseudoPartitive = true

Every inanimate first noun develops pseudo-partitive uses.

theorem TenWolde2023.pseudoPartitive_iff (n : Noun) : n ∈ Noun.all → (n.pseudoPartitive = true ↔ n.semanticClass = SemanticClass.inanimate ∨ n = Noun.snake ∨ n = Noun.hell)

The animate and abstract nouns with pseudo-partitive uses are snake and hell.

theorem TenWolde2023.exists_mem_chunk_of_fused (n : Noun) : n ∈ Noun.all → n.fused.isSome = true → ∃ s ∈ n.stages, s ∈ Diagnostic.chunk.span

A first noun has a reduced form only if it reaches a stage at which [N₁ of a] is a unit.

The constructional network

def TenWolde2023.Stage.construction : Stage → ConstructionGrammar.Construction Unit

The form of the construction at each stage; the optional a of the modifier and the intensifier is left out.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.simpleNP : ConstructionGrammar.Construction Unit

The simple noun phrase, whose classifying and evaluative premodifiers share their function with the binominals.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.adjectivePhrase : ConstructionGrammar.Construction Unit

The adjective phrase, whose intensifiers share their function with the binominal intensifier.

Equations

• One or more equations did not get rendered due to their size.

inductive TenWolde2023.Node : Type

The nodes of the network: the constructions of the path, the simple noun phrase and the adjective phrase.

• stage (s : Stage) : Node
• simpleNP : Node
• adjectivePhrase : Node

def TenWolde2023.instDecidableEqNode.decEq (x✝ x✝¹ : Node) : Decidable (x✝ = x✝¹)

Equations

• TenWolde2023.instDecidableEqNode.decEq (TenWolde2023.Node.stage a) (TenWolde2023.Node.stage b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
• TenWolde2023.instDecidableEqNode.decEq (TenWolde2023.Node.stage s) TenWolde2023.Node.simpleNP = isFalse ⋯
• TenWolde2023.instDecidableEqNode.decEq (TenWolde2023.Node.stage s) TenWolde2023.Node.adjectivePhrase = isFalse ⋯
• TenWolde2023.instDecidableEqNode.decEq TenWolde2023.Node.simpleNP (TenWolde2023.Node.stage s) = isFalse ⋯
• TenWolde2023.instDecidableEqNode.decEq TenWolde2023.Node.simpleNP TenWolde2023.Node.simpleNP = isTrue ⋯
• TenWolde2023.instDecidableEqNode.decEq TenWolde2023.Node.simpleNP TenWolde2023.Node.adjectivePhrase = isFalse TenWolde2023.instDecidableEqNode.decEq._proof_7
• TenWolde2023.instDecidableEqNode.decEq TenWolde2023.Node.adjectivePhrase (TenWolde2023.Node.stage s) = isFalse ⋯
• TenWolde2023.instDecidableEqNode.decEq TenWolde2023.Node.adjectivePhrase TenWolde2023.Node.simpleNP = isFalse TenWolde2023.instDecidableEqNode.decEq._proof_9
• TenWolde2023.instDecidableEqNode.decEq TenWolde2023.Node.adjectivePhrase TenWolde2023.Node.adjectivePhrase = isTrue ⋯

@[instance_reducible]

instance TenWolde2023.instDecidableEqNode : DecidableEq Node

Equations

• TenWolde2023.instDecidableEqNode = TenWolde2023.instDecidableEqNode.decEq

@[instance_reducible]

instance TenWolde2023.instFintypeNode : Fintype Node

Equations

• TenWolde2023.instFintypeNode = Fintype.ofEquiv (TenWolde2023.Stage ⊕ Unit ⊕ Unit) TenWolde2023.Node.proxyTypeEquiv

def TenWolde2023.construction : Node → ConstructionGrammar.Construction Unit

The construction at each node.

Equations

• TenWolde2023.construction (TenWolde2023.Node.stage a) = a.construction
• TenWolde2023.construction TenWolde2023.Node.simpleNP = TenWolde2023.simpleNP
• TenWolde2023.construction TenWolde2023.Node.adjectivePhrase = TenWolde2023.adjectivePhrase

def TenWolde2023.network : ConstructionGrammar.Constructicon Node Unit

The network of the of-binominals (chapter 8). Every construction after the N+PP has a taxonomic link to the schematic N+PP mother node, weakened for the evaluative modifier and the binominal intensifier (the dotted links of Figures 8.11 and 8.13). The horizontal links, which pass no information down, are the metaphorical extensions along the path at the micro-construction level, and the polysemy links from the head-classifier, the evaluative binominal and the evaluative modifier to the simple noun phrase, whose premodifiers share their function (a book of poetry and a poetry book), and from the binominal intensifier to the adjective phrase.

Equations

• One or more equations did not get rendered due to their size.

def TenWolde2023.Node.rank : Node → ℕ

The depth of a node below the N+PP mother node.

Equations

• (TenWolde2023.Node.stage TenWolde2023.Stage.nPP).rank = 0
• TenWolde2023.Node.simpleNP.rank = 0
• TenWolde2023.Node.adjectivePhrase.rank = 0
• (TenWolde2023.Node.stage s).rank = 1

@[instance_reducible]

instance TenWolde2023.instPartialOrderNode : PartialOrder Node

Equations

• TenWolde2023.instPartialOrderNode = TenWolde2023.network.partialOrder TenWolde2023.Node.rank TenWolde2023.instPartialOrderNode._proof_1

@[instance_reducible]

instance TenWolde2023.instDecidableLENode : DecidableLE Node

Equations

• TenWolde2023.instDecidableLENode = TenWolde2023.network.decidableLE [TenWolde2023.Node.stage TenWolde2023.Stage.nPP] TenWolde2023.instDecidableLENode._proof_1

theorem TenWolde2023.metaphorical_iff_covBy (s t : Stage) : (Node.stage t, some ConstructionGrammar.LinkType.metaphorical) ∈ network.related (Node.stage s) ↔ s ⋖ t

The metaphorical links are the covering relation of the path, so each stage is a metaphorical extension of the one before it and of no other.

def TenWolde2023.secondDeterminer : Node → Option Bool

Whether a construction states a second determiner: the N+PP has one, the head-classifier has none ("no Det2", Figure 8.6), and the constructions after it state nothing of their own.

Equations

• TenWolde2023.secondDeterminer (TenWolde2023.Node.stage TenWolde2023.Stage.nPP) = some true
• TenWolde2023.secondDeterminer (TenWolde2023.Node.stage TenWolde2023.Stage.headClassifier) = some false
• TenWolde2023.secondDeterminer x✝ = none

def TenWolde2023.secondDeterminerNumber : Node → Option Bool

Whether a construction states that its second determiner marks number: the N+PP's does, the head-classifier has none, and the evaluative modifier's "no longer marks number for N2" (Figure 8.10), nor does the binominal intensifier's.

Equations

• TenWolde2023.secondDeterminerNumber (TenWolde2023.Node.stage TenWolde2023.Stage.nPP) = some true
• TenWolde2023.secondDeterminerNumber (TenWolde2023.Node.stage TenWolde2023.Stage.headClassifier) = some false
• TenWolde2023.secondDeterminerNumber (TenWolde2023.Node.stage TenWolde2023.Stage.evaluativeModifier) = some false
• TenWolde2023.secondDeterminerNumber (TenWolde2023.Node.stage TenWolde2023.Stage.binominalIntensifier) = some false
• TenWolde2023.secondDeterminerNumber x✝ = none

theorem TenWolde2023.inherited_secondDeterminer (s : Stage) : true ∈ DefaultInheritance.inherited secondDeterminer (Node.stage s) ↔ s ∈ Diagnostic.det₂.span

"The inheritance link between the EBNP and the N+PP would explain the reappearance of the indefinite article in the second determiner position in the EBNP" (p. 226): the stages that inherit a second determiner through the network are exactly those at which the overview tables record one, the head-classifier excepted.

theorem TenWolde2023.inherited_secondDeterminerNumber (s : Stage) : true ∈ DefaultInheritance.inherited secondDeterminerNumber (Node.stage s) ↔ s ∈ Diagnostic.det₂Number.span

The evaluative binominal inherits a number-marking second determiner from the N+PP, the other exception to contiguity in the tables (ordConnected_span_iff).

theorem TenWolde2023.head_before_of_iff (s : Stage) : ((List.takeWhile (fun (x : ConstructionGrammar.Slot String) => decide (x.filler ≠ ConstructionGrammar.SlotFiller.fixed "of")) s.construction.form).any fun (x : ConstructionGrammar.Slot String) => x.isHead) = true ↔ s ∈ Diagnostic.n₁Head.span

The head of the form precedes of exactly at the stages where the first noun is the semantic head.

Subjectification

def TenWolde2023.Stage.level (s : Stage) : Traugott2010.SubjectivityLevel

The coded level of the first noun's meaning at a stage is nonsubjective while the noun ascribes an objective property and subjective once it expresses the speaker's evaluation.

Equations

• s.level = if s ∈ TenWolde2023.Diagnostic.n₁Evaluative.span then Traugott2010.SubjectivityLevel.subjective else Traugott2010.SubjectivityLevel.nonSubjective

theorem TenWolde2023.path_unidirectional : Traugott2010.Unidirectional (List.map Stage.level Stage.path)

The path follows [Tra10a]'s cline, with one subjectification at the evaluative binominal and bleaching within the subjective level after it.