Dutch Noun Lexicon Fragment

[Kri04] [Chi98] [LBdS22]

Dutch-specific noun entries with scrambling support. Dutch allows scrambling: objects can move across negation/adverbs, affecting bare plural scope.

Based on [LBdS22]: scrambled BPs take wide scope but can still be kind-referring, supporting [Kri04] over [Chi98].

structure Dutch.Nouns.NounEntry : Type

A lexical entry for a Dutch noun.

• formSg : String
• formPl : Option String
• countable : Bool
• proper : Bool
• formDim : Option String

@[implicit_reducible]

instance Dutch.Nouns.instReprNounEntry : Repr NounEntry

Equations

• Dutch.Nouns.instReprNounEntry = { reprPrec := Dutch.Nouns.instReprNounEntry.repr }

def Dutch.Nouns.instReprNounEntry.repr : NounEntry → ℕ → Std.Format

Equations

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

@[implicit_reducible]

instance Dutch.Nouns.instBEqNounEntry : BEq NounEntry

Equations

• Dutch.Nouns.instBEqNounEntry = { beq := Dutch.Nouns.instBEqNounEntry.beq }

def Dutch.Nouns.instBEqNounEntry.beq : NounEntry → NounEntry → Bool

Equations

• One or more equations did not get rendered due to their size.
• Dutch.Nouns.instBEqNounEntry.beq x✝¹ x✝ = false

inductive Dutch.Nouns.NPNumber : Type

Number marking on a Dutch NP.

• sg : NPNumber
• pl : NPNumber
• mass : NPNumber

@[implicit_reducible]

instance Dutch.Nouns.instDecidableEqNPNumber : DecidableEq NPNumber

Equations

• Dutch.Nouns.instDecidableEqNPNumber x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[implicit_reducible]

instance Dutch.Nouns.instReprNPNumber : Repr NPNumber

Equations

• Dutch.Nouns.instReprNPNumber = { reprPrec := Dutch.Nouns.instReprNPNumber.repr }

def Dutch.Nouns.instReprNPNumber.repr : NPNumber → ℕ → Std.Format

Equations

• Dutch.Nouns.instReprNPNumber.repr Dutch.Nouns.NPNumber.sg prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Dutch.Nouns.NPNumber.sg")).group prec✝
• Dutch.Nouns.instReprNPNumber.repr Dutch.Nouns.NPNumber.pl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Dutch.Nouns.NPNumber.pl")).group prec✝
• Dutch.Nouns.instReprNPNumber.repr Dutch.Nouns.NPNumber.mass prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Dutch.Nouns.NPNumber.mass")).group prec✝

def Dutch.Nouns.NPNumber.toNumber : NPNumber → Option Number

Dutch NP number in the canonical inventory; mass NPs bear no count-number value.

Equations

• Dutch.Nouns.NPNumber.sg.toNumber = some Number.singular
• Dutch.Nouns.NPNumber.pl.toNumber = some Number.plural
• Dutch.Nouns.NPNumber.mass.toNumber = none

inductive Dutch.Nouns.ScramblingPosition : Type

Scrambling position in the Dutch middle field.

• unscrambled : ScramblingPosition
• scrambled : ScramblingPosition

@[implicit_reducible]

instance Dutch.Nouns.instDecidableEqScramblingPosition : DecidableEq ScramblingPosition

Equations

• Dutch.Nouns.instDecidableEqScramblingPosition x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def Dutch.Nouns.instReprScramblingPosition.repr : ScramblingPosition → ℕ → Std.Format

Equations

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

@[implicit_reducible]

instance Dutch.Nouns.instReprScramblingPosition : Repr ScramblingPosition

Equations

• Dutch.Nouns.instReprScramblingPosition = { reprPrec := Dutch.Nouns.instReprScramblingPosition.repr }

structure Dutch.Nouns.NP : Type

A Dutch noun phrase with scrambling information.

• noun : NounEntry
• number : NPNumber
• isBare : Bool
• determiner : Option String
• position : Option ScramblingPosition

@[implicit_reducible]

instance Dutch.Nouns.instReprNP : Repr NP

Equations

• Dutch.Nouns.instReprNP = { reprPrec := Dutch.Nouns.instReprNP.repr }

def Dutch.Nouns.instReprNP.repr : NP → ℕ → Std.Format

Equations

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

def Dutch.Nouns.instBEqNP.beq : NP → NP → Bool

Equations

• One or more equations did not get rendered due to their size.
• Dutch.Nouns.instBEqNP.beq x✝¹ x✝ = false

@[implicit_reducible]

instance Dutch.Nouns.instBEqNP : BEq NP

Equations

• Dutch.Nouns.instBEqNP = { beq := Dutch.Nouns.instBEqNP.beq }

@[implicit_reducible]

instance Dutch.Nouns.instHasNumberNP : HasNumber NP

A Dutch NP bears its number slot canonically (HasNumber).

Equations

• Dutch.Nouns.instHasNumberNP = { numberOf := fun (np : Dutch.Nouns.NP) => np.number.toNumber }

def Dutch.Nouns.NP.isBarePlural (np : NP) : Bool

Equations

• np.isBarePlural = (np.isBare && np.number == Dutch.Nouns.NPNumber.pl)

def Dutch.Nouns.NP.isScrambled (np : NP) : Bool

Equations

• np.isScrambled = (np.position == some Dutch.Nouns.ScramblingPosition.scrambled)

def Dutch.Nouns.NP.isBareMass (np : NP) : Bool

Equations

• np.isBareMass = (np.isBare && np.number == Dutch.Nouns.NPNumber.mass)

def Dutch.Nouns.NP.isBareSingular (np : NP) : Bool

Equations

• np.isBareSingular = (np.isBare && np.number == Dutch.Nouns.NPNumber.sg)

def Dutch.Nouns.barePlural (n : NounEntry) : NP

Equations

• Dutch.Nouns.barePlural n = { noun := n, number := Dutch.Nouns.NPNumber.pl, isBare := true }

def Dutch.Nouns.barePluralScrambled (n : NounEntry) : NP

Equations

• Dutch.Nouns.barePluralScrambled n = { noun := n, number := Dutch.Nouns.NPNumber.pl, isBare := true, position := some Dutch.Nouns.ScramblingPosition.scrambled }

def Dutch.Nouns.barePluralUnscrambled (n : NounEntry) : NP

Equations

• Dutch.Nouns.barePluralUnscrambled n = { noun := n, number := Dutch.Nouns.NPNumber.pl, isBare := true, position := some Dutch.Nouns.ScramblingPosition.unscrambled }

def Dutch.Nouns.bareMass (n : NounEntry) : NP

Equations

• Dutch.Nouns.bareMass n = { noun := n, number := Dutch.Nouns.NPNumber.mass, isBare := true }

def Dutch.Nouns.bareSingular (n : NounEntry) : NP

Equations

• Dutch.Nouns.bareSingular n = { noun := n, number := Dutch.Nouns.NPNumber.sg, isBare := true }

def Dutch.Nouns.definiteNP (n : NounEntry) (det : String := "de") (num : NPNumber := NPNumber.sg) : NP

Equations

• Dutch.Nouns.definiteNP n det num = { noun := n, number := num, isBare := false, determiner := some det }

def Dutch.Nouns.eenNP (n : NounEntry) : NP

Equations

• Dutch.Nouns.eenNP n = { noun := n, number := Dutch.Nouns.NPNumber.sg, isBare := false, determiner := some "een" }

def Dutch.Nouns.dutchBlocking : Semantics.Kinds.NMP.BlockingPrinciple

Dutch blocking: articles block covert type shifts, bare singulars cannot occur.

Equations

• Dutch.Nouns.dutchBlocking = { determiners := ["de", "het", "een", "alle", "geen", "sommige"], iotaBlocked := true, existsBlocked := true, downBlocked := false }

def Dutch.Nouns.barePluralScope (np : NP) : String

BP scope: unscrambled = narrow, scrambled = wide.

Equations

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

def Dutch.Nouns.boek : NounEntry

Equations

• Dutch.Nouns.boek = { formSg := "boek", formPl := some "boeken", formDim := some "boekje" }

def Dutch.Nouns.mens : NounEntry

Equations

• Dutch.Nouns.mens = { formSg := "mens", formPl := some "mensen" }

def Dutch.Nouns.geest : NounEntry

Equations

• Dutch.Nouns.geest = { formSg := "geest", formPl := some "geesten" }

def Dutch.Nouns.student : NounEntry

Equations

• Dutch.Nouns.student = { formSg := "student", formPl := some "studenten" }

def Dutch.Nouns.hond : NounEntry

Equations

• Dutch.Nouns.hond = { formSg := "hond", formPl := some "honden", formDim := some "hondje" }

def Dutch.Nouns.kat : NounEntry

Equations

• Dutch.Nouns.kat = { formSg := "kat", formPl := some "katten", formDim := some "katje" }

def Dutch.Nouns.film : NounEntry

Equations

• Dutch.Nouns.film = { formSg := "film", formPl := some "films", formDim := some "filmpje" }

def Dutch.Nouns.water : NounEntry

Equations

• Dutch.Nouns.water = { formSg := "water", countable := false }

def Dutch.Nouns.goud : NounEntry

Equations

• Dutch.Nouns.goud = { formSg := "goud", countable := false }

def Dutch.Nouns.meel : NounEntry

Equations

• Dutch.Nouns.meel = { formSg := "meel", countable := false }

def Dutch.Nouns.helen : NounEntry

Equations

• Dutch.Nouns.helen = { formSg := "Helen", proper := true }

def Dutch.Nouns.jan : NounEntry

Equations

• Dutch.Nouns.jan = { formSg := "Jan", proper := true }

def Dutch.Nouns.piet : NounEntry

Equations

• Dutch.Nouns.piet = { formSg := "Piet", proper := true }

def Dutch.Nouns.marie : NounEntry

Equations

• Dutch.Nouns.marie = { formSg := "Marie", proper := true }

def Dutch.Nouns.allNouns : List NounEntry

Equations

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

def Dutch.Nouns.lookup (form : String) : Option NounEntry

Equations

• Dutch.Nouns.lookup form = List.find? (fun (n : Dutch.Nouns.NounEntry) => n.formSg == form || n.formPl == some form || n.formDim == some form) Dutch.Nouns.allNouns

def Dutch.Nouns.barePluralLicensed : Bool

Equations

• Dutch.Nouns.barePluralLicensed = !Dutch.Nouns.dutchBlocking.downBlocked

def Dutch.Nouns.bareMassLicensed : Bool

Equations

• Dutch.Nouns.bareMassLicensed = !Dutch.Nouns.dutchBlocking.downBlocked

def Dutch.Nouns.bareSingularLicensed : Bool

Equations

• Dutch.Nouns.bareSingularLicensed = (!Dutch.Nouns.dutchBlocking.iotaBlocked || !Dutch.Nouns.dutchBlocking.existsBlocked)

def Dutch.Nouns.boekenScrambled : NP

Equations

• Dutch.Nouns.boekenScrambled = Dutch.Nouns.barePluralScrambled Dutch.Nouns.boek

def Dutch.Nouns.boekenUnscrambled : NP

Equations

• Dutch.Nouns.boekenUnscrambled = Dutch.Nouns.barePluralUnscrambled Dutch.Nouns.boek

def Dutch.Nouns.mensenScrambled : NP

Equations

• Dutch.Nouns.mensenScrambled = Dutch.Nouns.barePluralScrambled Dutch.Nouns.mens

def Dutch.Nouns.geestenUnscrambled : NP

Equations

• Dutch.Nouns.geestenUnscrambled = Dutch.Nouns.barePluralUnscrambled Dutch.Nouns.geest