English Noun Lexicon Fragment

English NP structure. Bare plurals/mass nouns OK, bare singulars blocked.

structure Fragments.English.Nouns.NounEntry : Type

A lexical entry for an English noun.

The countable field records a morphosyntactic fact about the noun's conventional behavior in English (does it pluralize? does it take "a"?). This is theory-neutral data:

• @cite{chierchia-1998} treats countable as a lexical feature on nouns, directly encoding the mass/count distinction.
• @cite{borer-2005} claims countable is derivable from functional structure (presence of Q in the EP spine) and should not be a primitive. See same_root_mass_and_count.

Both theories are compatible with this fragment: Chierchia uses the field directly; Borer proves it redundant via a bridge.

• formSg : String

  Singular form

• formPl : Option String

  Plural form (none for mass nouns)

• countable : MassCount

  Mass/count feature

• proper : Bool

  Is this a proper name?

instance Fragments.English.Nouns.instReprNounEntry : Repr NounEntry

Equations

• Fragments.English.Nouns.instReprNounEntry = { reprPrec := Fragments.English.Nouns.instReprNounEntry.repr }

def Fragments.English.Nouns.instReprNounEntry.repr : NounEntry → ℕ → Std.Format

Equations

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

instance Fragments.English.Nouns.instBEqNounEntry : BEq NounEntry

Equations

• Fragments.English.Nouns.instBEqNounEntry = { beq := Fragments.English.Nouns.instBEqNounEntry.beq }

def Fragments.English.Nouns.instBEqNounEntry.beq : NounEntry → NounEntry → Bool

Equations

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

inductive Fragments.English.Nouns.NPNumber : Type

Number marking on an English NP

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

instance Fragments.English.Nouns.instDecidableEqNPNumber : DecidableEq NPNumber

Equations

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

instance Fragments.English.Nouns.instReprNPNumber : Repr NPNumber

Equations

• Fragments.English.Nouns.instReprNPNumber = { reprPrec := Fragments.English.Nouns.instReprNPNumber.repr }

def Fragments.English.Nouns.instReprNPNumber.repr : NPNumber → ℕ → Std.Format

Equations

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

def Fragments.English.Nouns.instBEqNPNumber.beq : NPNumber → NPNumber → Bool

Equations

• Fragments.English.Nouns.instBEqNPNumber.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

instance Fragments.English.Nouns.instBEqNPNumber : BEq NPNumber

Equations

• Fragments.English.Nouns.instBEqNPNumber = { beq := Fragments.English.Nouns.instBEqNPNumber.beq }

structure Fragments.English.Nouns.NP : Type

An English noun phrase.

• noun : NounEntry

  The underlying noun

• number : NPNumber

  Number marking

• isBare : Bool

  Is this a bare NP (no determiner)?

• determiner : Option String

  The determiner (if not bare)

instance Fragments.English.Nouns.instReprNP : Repr NP

Equations

• Fragments.English.Nouns.instReprNP = { reprPrec := Fragments.English.Nouns.instReprNP.repr }

def Fragments.English.Nouns.instReprNP.repr : NP → ℕ → Std.Format

Equations

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

def Fragments.English.Nouns.instBEqNP.beq : NP → NP → Bool

Equations

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

instance Fragments.English.Nouns.instBEqNP : BEq NP

Equations

• Fragments.English.Nouns.instBEqNP = { beq := Fragments.English.Nouns.instBEqNP.beq }

def Fragments.English.Nouns.NP.isBarePlural (np : NP) : Bool

Is this NP a bare plural?

Equations

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

def Fragments.English.Nouns.NP.isBareMass (np : NP) : Bool

Is this NP a bare mass noun?

Equations

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

def Fragments.English.Nouns.NP.isBareSingular (np : NP) : Bool

Is this NP a bare singular?

Equations

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

def Fragments.English.Nouns.barePlural (n : NounEntry) : NP

Create a bare plural NP

Equations

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

def Fragments.English.Nouns.bareMass (n : NounEntry) : NP

Create a bare mass NP

Equations

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

def Fragments.English.Nouns.bareSingular (n : NounEntry) : NP

Create a bare singular NP (ungrammatical in English)

Equations

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

def Fragments.English.Nouns.theNP (n : NounEntry) (num : NPNumber := NPNumber.sg) : NP

Create a definite NP with "the"

Equations

• Fragments.English.Nouns.theNP n num = { noun := n, number := num, isBare := false, determiner := some "the" }

def Fragments.English.Nouns.aNP (n : NounEntry) : NP

Create an indefinite singular NP with "a"

Equations

• Fragments.English.Nouns.aNP n = { noun := n, number := Fragments.English.Nouns.NPNumber.sg, isBare := false, determiner := some "a" }

def Fragments.English.Nouns.withDet (n : NounEntry) (det : String) (num : NPNumber := NPNumber.sg) : NP

Create an NP with a specific determiner

Equations

• Fragments.English.Nouns.withDet n det num = { noun := n, number := num, isBare := false, determiner := some det }

def Fragments.English.Nouns.englishMapping : Semantics.Lexical.Noun.Kind.Chierchia1998.NominalMapping

English is a [+arg, +pred] language (@cite{chierchia-1998}): nouns can denote both arguments (kinds) and predicates (properties). Bare plurals can be kind-denoting without overt D.

Equations

• Fragments.English.Nouns.englishMapping = Semantics.Lexical.Noun.Kind.Chierchia1998.NominalMapping.argAndPred

def Fragments.English.Nouns.englishBlocking : Semantics.Lexical.Noun.Kind.Chierchia1998.BlockingPrinciple

English has articles that block covert type shifts:

• "the" blocks ι (iota, definite description)
• "a/some" blocks ∃ for singulars
• Nothing blocks ∩ (kind formation)

Result: bare singulars cannot occur as arguments.

Equations

• Fragments.English.Nouns.englishBlocking = { determiners := ["the", "a", "some", "every", "no"], iotaBlocked := true, existsBlocked := true, downBlocked := false }

def Fragments.English.Nouns.pizza : NounEntry

Equations

• Fragments.English.Nouns.pizza = { formSg := "pizza", formPl := some "pizzas" }

def Fragments.English.Nouns.book : NounEntry

Equations

• Fragments.English.Nouns.book = { formSg := "book", formPl := some "books" }

def Fragments.English.Nouns.cat : NounEntry

Equations

• Fragments.English.Nouns.cat = { formSg := "cat", formPl := some "cats" }

def Fragments.English.Nouns.dog : NounEntry

Equations

• Fragments.English.Nouns.dog = { formSg := "dog", formPl := some "dogs" }

def Fragments.English.Nouns.girl : NounEntry

Equations

• Fragments.English.Nouns.girl = { formSg := "girl", formPl := some "girls" }

def Fragments.English.Nouns.boy : NounEntry

Equations

• Fragments.English.Nouns.boy = { formSg := "boy", formPl := some "boys" }

def Fragments.English.Nouns.ball : NounEntry

Equations

• Fragments.English.Nouns.ball = { formSg := "ball", formPl := some "balls" }

def Fragments.English.Nouns.table : NounEntry

Equations

• Fragments.English.Nouns.table = { formSg := "table", formPl := some "tables" }

def Fragments.English.Nouns.squirrel : NounEntry

Equations

• Fragments.English.Nouns.squirrel = { formSg := "squirrel", formPl := some "squirrels" }

def Fragments.English.Nouns.man : NounEntry

Equations

• Fragments.English.Nouns.man = { formSg := "man", formPl := some "men" }

def Fragments.English.Nouns.woman : NounEntry

Equations

• Fragments.English.Nouns.woman = { formSg := "woman", formPl := some "women" }

def Fragments.English.Nouns.person : NounEntry

Equations

• Fragments.English.Nouns.person = { formSg := "person", formPl := some "people" }

def Fragments.English.Nouns.child : NounEntry

Equations

• Fragments.English.Nouns.child = { formSg := "child", formPl := some "children" }

def Fragments.English.Nouns.lawyer : NounEntry

Equations

• Fragments.English.Nouns.lawyer = { formSg := "lawyer", formPl := some "lawyers" }

def Fragments.English.Nouns.student : NounEntry

Equations

• Fragments.English.Nouns.student = { formSg := "student", formPl := some "students" }

def Fragments.English.Nouns.teacher : NounEntry

Equations

• Fragments.English.Nouns.teacher = { formSg := "teacher", formPl := some "teachers" }

def Fragments.English.Nouns.fireman : NounEntry

Equations

• Fragments.English.Nouns.fireman = { formSg := "fireman", formPl := some "firemen" }

def Fragments.English.Nouns.soldier : NounEntry

Equations

• Fragments.English.Nouns.soldier = { formSg := "soldier", formPl := some "soldiers" }

def Fragments.English.Nouns.horse : NounEntry

Equations

• Fragments.English.Nouns.horse = { formSg := "horse", formPl := some "horses" }

def Fragments.English.Nouns.brother : NounEntry

Equations

• Fragments.English.Nouns.brother = { formSg := "brother", formPl := some "brothers" }

def Fragments.English.Nouns.spy : NounEntry

Equations

• Fragments.English.Nouns.spy = { formSg := "spy", formPl := some "spies" }

def Fragments.English.Nouns.water : NounEntry

Equations

• Fragments.English.Nouns.water = { formSg := "water", countable := MassCount.mass }

def Fragments.English.Nouns.sand : NounEntry

Equations

• Fragments.English.Nouns.sand = { formSg := "sand", countable := MassCount.mass }

def Fragments.English.Nouns.furniture : NounEntry

Equations

• Fragments.English.Nouns.furniture = { formSg := "furniture", countable := MassCount.mass }

def Fragments.English.Nouns.rice : NounEntry

Equations

• Fragments.English.Nouns.rice = { formSg := "rice", countable := MassCount.mass }

def Fragments.English.Nouns.gold : NounEntry

Equations

• Fragments.English.Nouns.gold = { formSg := "gold", countable := MassCount.mass }

def Fragments.English.Nouns.air : NounEntry

Equations

• Fragments.English.Nouns.air = { formSg := "air", countable := MassCount.mass }

def Fragments.English.Nouns.john : NounEntry

Equations

• Fragments.English.Nouns.john = { formSg := "John", proper := true }

def Fragments.English.Nouns.mary : NounEntry

Equations

• Fragments.English.Nouns.mary = { formSg := "Mary", proper := true }

def Fragments.English.Nouns.bill : NounEntry

Equations

• Fragments.English.Nouns.bill = { formSg := "Bill", proper := true }

def Fragments.English.Nouns.sue : NounEntry

Equations

• Fragments.English.Nouns.sue = { formSg := "Sue", proper := true }

def Fragments.English.Nouns.fred : NounEntry

Equations

• Fragments.English.Nouns.fred = { formSg := "Fred", proper := true }

def Fragments.English.Nouns.bean : NounEntry

Equations

• Fragments.English.Nouns.bean = { formSg := "bean", formPl := some "beans" }

def Fragments.English.Nouns.allNouns : List NounEntry

Equations

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

def Fragments.English.Nouns.NounEntry.toWordSg (n : NounEntry) : Word

Convert a noun entry to a Word in singular form. Proper names get cat :=.PROPN, person :=.third. Common nouns get cat :=.NOUN, countable.

Equations

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

def Fragments.English.Nouns.NounEntry.toWordPl (n : NounEntry) : Word

Convert a noun entry to a Word in plural form. Defaults to appending "s" if no irregular plural is specified.

Equations

• n.toWordPl = { form := n.formPl.getD (n.formSg ++ "s"), cat := UD.UPOS.NOUN, features := { number := some Number.pl, countable := some n.countable } }

def Fragments.English.Nouns.NounEntry.toStem {α : Type} (n : NounEntry) : Core.Morphology.Stem (α → Bool)

Convert a NounEntry to a morphological Stem.

Countable nouns get a plural rule; irregular plurals (man/men, child/children) use a custom formRule. Mass nouns and proper names have empty paradigms.

Equations

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

def Fragments.English.Nouns.lookup (form : String) : Option NounEntry

Equations

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

def Fragments.English.Nouns.barePluralLicensed : Bool

In English, bare plurals are licensed

Equations

• Fragments.English.Nouns.barePluralLicensed = !Fragments.English.Nouns.englishBlocking.downBlocked

def Fragments.English.Nouns.bareMassLicensed : Bool

In English, bare mass nouns are licensed

Equations

• Fragments.English.Nouns.bareMassLicensed = !Fragments.English.Nouns.englishBlocking.downBlocked

def Fragments.English.Nouns.bareSingularLicensed : Bool

In English, bare singulars are NOT licensed

Equations

• Fragments.English.Nouns.bareSingularLicensed = decide ((!Fragments.English.Nouns.englishBlocking.iotaBlocked) = true ∨ (!Fragments.English.Nouns.englishBlocking.existsBlocked) = true)

def Fragments.English.Nouns.dogs : NP

"dogs" as bare plural

Equations

• Fragments.English.Nouns.dogs = Fragments.English.Nouns.barePlural Fragments.English.Nouns.dog

def Fragments.English.Nouns.waterNP : NP

"water" as bare mass

Equations

• Fragments.English.Nouns.waterNP = Fragments.English.Nouns.bareMass Fragments.English.Nouns.water

def Fragments.English.Nouns.theDog : NP

"the dog"

Equations

• Fragments.English.Nouns.theDog = Fragments.English.Nouns.theNP Fragments.English.Nouns.dog

def Fragments.English.Nouns.aDog : NP

"a dog"

Equations

• Fragments.English.Nouns.aDog = Fragments.English.Nouns.aNP Fragments.English.Nouns.dog

def Fragments.English.Nouns.everyDog : NP

"every dog"

Equations

• Fragments.English.Nouns.everyDog = Fragments.English.Nouns.withDet Fragments.English.Nouns.dog "every"