French Noun Lexicon Fragment

French NP structure with gender. Bare arguments restricted (@cite{chierchia-1998} [-arg, +pred]).

inductive Fragments.French.Nouns.Gender : Type

Grammatical gender

• masc : Gender
• fem : Gender

instance Fragments.French.Nouns.instDecidableEqGender : DecidableEq Gender

Equations

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

instance Fragments.French.Nouns.instReprGender : Repr Gender

Equations

• Fragments.French.Nouns.instReprGender = { reprPrec := Fragments.French.Nouns.instReprGender.repr }

def Fragments.French.Nouns.instReprGender.repr : Gender → ℕ → Std.Format

Equations

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

instance Fragments.French.Nouns.instBEqGender : BEq Gender

Equations

• Fragments.French.Nouns.instBEqGender = { beq := Fragments.French.Nouns.instBEqGender.beq }

def Fragments.French.Nouns.instBEqGender.beq : Gender → Gender → Bool

Equations

• Fragments.French.Nouns.instBEqGender.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

structure Fragments.French.Nouns.NounEntry : Type

A lexical entry for a French noun.

French nouns have grammatical gender.

• formSg : String

  Singular form

• formPl : Option String

  Plural form

• gender : Gender

  Grammatical gender

• countable : Bool

  Is this a count noun?

• proper : Bool

  Is this a proper name?

instance Fragments.French.Nouns.instReprNounEntry : Repr NounEntry

Equations

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

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

Equations

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

instance Fragments.French.Nouns.instBEqNounEntry : BEq NounEntry

Equations

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

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

Equations

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

inductive Fragments.French.Nouns.Determiner : Type

French determiners

• le : Determiner
• la : Determiner
• les : Determiner
• un : Determiner
• une : Determiner
• des : Determiner
• du : Determiner
• dela : Determiner

instance Fragments.French.Nouns.instDecidableEqDeterminer : DecidableEq Determiner

Equations

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

instance Fragments.French.Nouns.instReprDeterminer : Repr Determiner

Equations

• Fragments.French.Nouns.instReprDeterminer = { reprPrec := Fragments.French.Nouns.instReprDeterminer.repr }

def Fragments.French.Nouns.instReprDeterminer.repr : Determiner → ℕ → Std.Format

Equations

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

instance Fragments.French.Nouns.instBEqDeterminer : BEq Determiner

Equations

• Fragments.French.Nouns.instBEqDeterminer = { beq := Fragments.French.Nouns.instBEqDeterminer.beq }

def Fragments.French.Nouns.instBEqDeterminer.beq : Determiner → Determiner → Bool

Equations

• Fragments.French.Nouns.instBEqDeterminer.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

structure Fragments.French.Nouns.NP : Type

French NP structure.

French NPs require determiners in most contexts.

• noun : NounEntry

  The underlying noun

• number : Number

  Number

• isBare : Bool

  Is this a bare NP (no determiner)?

• determiner : Option Determiner

  The determiner (if not bare)

instance Fragments.French.Nouns.instReprNP : Repr NP

Equations

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

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

Equations

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

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

Equations

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

instance Fragments.French.Nouns.instBEqNP : BEq NP

Equations

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

def Fragments.French.Nouns.frenchBlocking : Semantics.Lexical.Noun.Kind.Chierchia1998.BlockingPrinciple

French has a rich article system that blocks most bare arguments.

Equations

• Fragments.French.Nouns.frenchBlocking = { determiners := ["le", "la", "les", "un", "une", "des", "du", "de la"], iotaBlocked := true, existsBlocked := true, downBlocked := false }

def Fragments.French.Nouns.frenchMapping : Semantics.Lexical.Noun.Kind.Chierchia1998.NominalMapping

French is a [-arg, +pred] language

Equations

• Fragments.French.Nouns.frenchMapping = Semantics.Lexical.Noun.Kind.Chierchia1998.NominalMapping.predOnly

def Fragments.French.Nouns.defNP (n : NounEntry) (num : Number := Number.sg) : NP

Create a definite NP (le/la/les)

Equations

• Fragments.French.Nouns.defNP n UD.Number.Sing = { noun := n, number := UD.Number.Sing, isBare := false, determiner := some Fragments.French.Nouns.Determiner.le }
• Fragments.French.Nouns.defNP n UD.Number.Sing = { noun := n, number := UD.Number.Sing, isBare := false, determiner := some Fragments.French.Nouns.Determiner.la }
• Fragments.French.Nouns.defNP n num✝ = { noun := n, number := num✝, isBare := false, determiner := some Fragments.French.Nouns.Determiner.les }

def Fragments.French.Nouns.indefNP (n : NounEntry) : NP

Create an indefinite singular NP (un/une)

Equations

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

def Fragments.French.Nouns.desNP (n : NounEntry) : NP

Create an indefinite plural NP (des)

Equations

• Fragments.French.Nouns.desNP n = { noun := n, number := Number.pl, isBare := false, determiner := some Fragments.French.Nouns.Determiner.des }

def Fragments.French.Nouns.partNP (n : NounEntry) : NP

Create a partitive NP (du/de la) for mass nouns

Equations

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

def Fragments.French.Nouns.bareNP (n : NounEntry) (num : Number := Number.sg) : NP

Create a bare NP (restricted in French)

Equations

• Fragments.French.Nouns.bareNP n num = { noun := n, number := num, isBare := true }

def Fragments.French.Nouns.chien : NounEntry

Equations

• Fragments.French.Nouns.chien = { formSg := "chien", formPl := some "chiens", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.chat : NounEntry

Equations

• Fragments.French.Nouns.chat = { formSg := "chat", formPl := some "chats", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.livre : NounEntry

Equations

• Fragments.French.Nouns.livre = { formSg := "livre", formPl := some "livres", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.homme : NounEntry

Equations

• Fragments.French.Nouns.homme = { formSg := "homme", formPl := some "hommes", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.garcon : NounEntry

Equations

• Fragments.French.Nouns.garcon = { formSg := "garçon", formPl := some "garçons", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.professeur : NounEntry

Equations

• Fragments.French.Nouns.professeur = { formSg := "professeur", formPl := some "professeurs", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.etudiant : NounEntry

Equations

• Fragments.French.Nouns.etudiant = { formSg := "étudiant", formPl := some "étudiants", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.avocat : NounEntry

Equations

• Fragments.French.Nouns.avocat = { formSg := "avocat", formPl := some "avocats", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.cheval : NounEntry

Equations

• Fragments.French.Nouns.cheval = { formSg := "cheval", formPl := some "chevaux", gender := Fragments.French.Nouns.Gender.masc }

def Fragments.French.Nouns.fille : NounEntry

Equations

• Fragments.French.Nouns.fille = { formSg := "fille", formPl := some "filles", gender := Fragments.French.Nouns.Gender.fem }

def Fragments.French.Nouns.femme : NounEntry

Equations

• Fragments.French.Nouns.femme = { formSg := "femme", formPl := some "femmes", gender := Fragments.French.Nouns.Gender.fem }

def Fragments.French.Nouns.table : NounEntry

Equations

• Fragments.French.Nouns.table = { formSg := "table", formPl := some "tables", gender := Fragments.French.Nouns.Gender.fem }

def Fragments.French.Nouns.pomme : NounEntry

Equations

• Fragments.French.Nouns.pomme = { formSg := "pomme", formPl := some "pommes", gender := Fragments.French.Nouns.Gender.fem }

def Fragments.French.Nouns.fleur : NounEntry

Equations

• Fragments.French.Nouns.fleur = { formSg := "fleur", formPl := some "fleurs", gender := Fragments.French.Nouns.Gender.fem }

def Fragments.French.Nouns.eau : NounEntry

Equations

• Fragments.French.Nouns.eau = { formSg := "eau", gender := Fragments.French.Nouns.Gender.fem, countable := false }

def Fragments.French.Nouns.vin : NounEntry

Equations

• Fragments.French.Nouns.vin = { formSg := "vin", gender := Fragments.French.Nouns.Gender.masc, countable := false }

def Fragments.French.Nouns.pain : NounEntry

Equations

• Fragments.French.Nouns.pain = { formSg := "pain", gender := Fragments.French.Nouns.Gender.masc, countable := false }

def Fragments.French.Nouns.lait : NounEntry

Equations

• Fragments.French.Nouns.lait = { formSg := "lait", gender := Fragments.French.Nouns.Gender.masc, countable := false }

def Fragments.French.Nouns.jean : NounEntry

Equations

• Fragments.French.Nouns.jean = { formSg := "Jean", gender := Fragments.French.Nouns.Gender.masc, proper := true }

def Fragments.French.Nouns.marie : NounEntry

Equations

• Fragments.French.Nouns.marie = { formSg := "Marie", gender := Fragments.French.Nouns.Gender.fem, proper := true }

def Fragments.French.Nouns.pierre : NounEntry

Equations

• Fragments.French.Nouns.pierre = { formSg := "Pierre", gender := Fragments.French.Nouns.Gender.masc, proper := true }

def Fragments.French.Nouns.allNouns : List NounEntry

Equations

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

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

Equations

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

def Fragments.French.Nouns.barePluralLicensed : Bool

In French, bare plurals are NOT generally licensed

Equations

• Fragments.French.Nouns.barePluralLicensed = false

def Fragments.French.Nouns.bareSingularLicensed : Bool

In French, bare singulars are NOT licensed

Equations

• Fragments.French.Nouns.bareSingularLicensed = false

def Fragments.French.Nouns.leChien : NP

"le chien" (the dog)

Equations

• Fragments.French.Nouns.leChien = Fragments.French.Nouns.defNP Fragments.French.Nouns.chien

def Fragments.French.Nouns.lesChiens : NP

"les chiens" (the dogs)

Equations

• Fragments.French.Nouns.lesChiens = Fragments.French.Nouns.defNP Fragments.French.Nouns.chien Number.pl

def Fragments.French.Nouns.unChien : NP

"un chien" (a dog)

Equations

• Fragments.French.Nouns.unChien = Fragments.French.Nouns.indefNP Fragments.French.Nouns.chien

def Fragments.French.Nouns.desPommes : NP

"des pommes" (some apples) - required where English uses bare plural

Equations

• Fragments.French.Nouns.desPommes = Fragments.French.Nouns.desNP Fragments.French.Nouns.pomme

def Fragments.French.Nouns.duVin : NP

"du vin" (some wine) - partitive

Equations

• Fragments.French.Nouns.duVin = Fragments.French.Nouns.partNP Fragments.French.Nouns.vin