Word tokens

The surface token: the unit (morpho)syntax treats as a word, approximating the ms-word of the ms-word/p-word split ([KBC+26]; the p-word is Phonology/Prosody/Word.lean). The token carries no theory of how words are formed: word-internal structure is Word/Tree.lean, the word-forming correspondence Paradigm/Linkage. A property belongs on the token only when a token-level engine reads it off the token's own data.

structure Morphology.Word : Type

A word token is a surface form with its UD category and morphological features, as in a CoNLL-U row.

• form : String

  The surface form.

• cat : UD.UPOS

  The UD category.

• features : UD.MorphFeatures

  The UD morphological features.

def Morphology.instReprWord.repr : Word → ℕ → Std.Format

Equations

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

@[implicit_reducible]

instance Morphology.instReprWord : Repr Word

Equations

• Morphology.instReprWord = { reprPrec := Morphology.instReprWord.repr }

@[implicit_reducible]

instance Morphology.instDecidableEqWord : DecidableEq Word

Equations

• Morphology.instDecidableEqWord = Morphology.instDecidableEqWord.decEq

def Morphology.instDecidableEqWord.decEq (x✝ x✝¹ : Word) : Decidable (x✝ = x✝¹)

Equations

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

def Morphology.Word.mk' (form : String) (cat : UD.UPOS) : Word

The featureless word with the given form and category.

Equations

• Morphology.Word.mk' form cat = { form := form, cat := cat }

@[implicit_reducible]

instance Morphology.instHasNumberWord : HasNumber Word

Equations

• Morphology.instHasNumberWord = { numberOf := fun (w : Morphology.Word) => Option.bind w.features.number Number.fromUD }

@[implicit_reducible]

instance Morphology.instHasPersonWord : HasPerson Word

Equations

• Morphology.instHasPersonWord = { personOf := fun (w : Morphology.Word) => Option.map Person.fromUD w.features.person }

@[implicit_reducible]

instance Morphology.instHasCaseWord : HasCase Word

Equations

• Morphology.instHasCaseWord = { caseOf := fun (w : Morphology.Word) => Option.map Case.fromUD w.features.case_ }

@[implicit_reducible]

instance Morphology.instBEqWord : BEq Word

Words compare by form and category, ignoring features, so homographs collapse.

Equations

• Morphology.instBEqWord = { beq := fun (w1 w2 : Morphology.Word) => w1.form == w2.form && w1.cat == w2.cat }

@[implicit_reducible]

instance Morphology.instToStringWord : ToString Word

Equations

• Morphology.instToStringWord = { toString := fun (w : Morphology.Word) => w.form }