Universal Dependencies: dependency relations

[dMMNZ21]

The universal dependency relations of UD v2 and the arcs of a dependency tree, the vocabulary of the dependency grammars and of the dependency-length data.

Official site: https://universaldependencies.org/

inductive UD.DepRel : Type

Universal dependency relations.

Organized by function following the UD documentation. These encode grammatical relations between a head and its dependent.

Reference: https://universaldependencies.org/u/dep/

• nsubj : DepRel
• nsubjPass : DepRel
• csubj : DepRel
• csubjPass : DepRel
• obj : DepRel
• iobj : DepRel
• ccomp : DepRel
• xcomp : DepRel
• obl : DepRel
• vocative : DepRel
• expl : DepRel
• dislocated : DepRel
• advcl : DepRel
• nmod : DepRel
• appos : DepRel
• nummod : DepRel
• acl : DepRel
• amod : DepRel
• advmod : DepRel
• discourse : DepRel
• aux : DepRel
• auxPass : DepRel
• cop : DepRel
• mark : DepRel
• det : DepRel
• clf : DepRel
• case_ : DepRel
• compound : DepRel
• flat : DepRel
• fixed : DepRel
• list : DepRel
• parataxis : DepRel
• orphan : DepRel
• goesWith : DepRel
• reparandum : DepRel
• conj : DepRel
• cc : DepRel
• punct : DepRel
• root : DepRel
• dep : DepRel

@[instance_reducible]

instance UD.instDecidableEqDepRel : DecidableEq DepRel

Equations

• UD.instDecidableEqDepRel x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def UD.instReprDepRel.repr : DepRel → ℕ → Std.Format

Equations

• UD.instReprDepRel.repr UD.DepRel.nsubj prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.nsubj")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.nsubjPass prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.nsubjPass")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.csubj prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.csubj")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.csubjPass prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.csubjPass")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.obj prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.obj")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.iobj prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.iobj")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.ccomp prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.ccomp")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.xcomp prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.xcomp")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.obl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.obl")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.vocative prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.vocative")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.expl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.expl")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.dislocated prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.dislocated")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.advcl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.advcl")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.nmod prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.nmod")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.appos prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.appos")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.nummod prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.nummod")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.acl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.acl")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.amod prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.amod")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.advmod prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.advmod")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.discourse prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.discourse")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.aux prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.aux")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.auxPass prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.auxPass")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.cop prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.cop")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.mark prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.mark")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.det prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.det")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.clf prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.clf")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.case_ prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.case_")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.compound prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.compound")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.flat prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.flat")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.fixed prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.fixed")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.list prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.list")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.parataxis prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.parataxis")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.orphan prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.orphan")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.goesWith prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.goesWith")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.reparandum prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.reparandum")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.conj prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.conj")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.cc prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.cc")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.punct prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.punct")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.root prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.root")).group prec✝
• UD.instReprDepRel.repr UD.DepRel.dep prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "UD.DepRel.dep")).group prec✝

@[instance_reducible]

instance UD.instReprDepRel : Repr DepRel

Equations

• UD.instReprDepRel = { reprPrec := UD.instReprDepRel.repr }

@[instance_reducible]

instance UD.instInhabitedDepRel : Inhabited DepRel

Equations

• UD.instInhabitedDepRel = { default := UD.instInhabitedDepRel.default }

def UD.DepRel.toString : DepRel → String

String representation matching UD conventions

Equations

• UD.DepRel.nsubj.toString = "nsubj"
• UD.DepRel.nsubjPass.toString = "nsubj:pass"
• UD.DepRel.csubj.toString = "csubj"
• UD.DepRel.csubjPass.toString = "csubj:pass"
• UD.DepRel.obj.toString = "obj"
• UD.DepRel.iobj.toString = "iobj"
• UD.DepRel.ccomp.toString = "ccomp"
• UD.DepRel.xcomp.toString = "xcomp"
• UD.DepRel.obl.toString = "obl"
• UD.DepRel.vocative.toString = "vocative"
• UD.DepRel.expl.toString = "expl"
• UD.DepRel.dislocated.toString = "dislocated"
• UD.DepRel.advcl.toString = "advcl"
• UD.DepRel.nmod.toString = "nmod"
• UD.DepRel.appos.toString = "appos"
• UD.DepRel.nummod.toString = "nummod"
• UD.DepRel.acl.toString = "acl"
• UD.DepRel.amod.toString = "amod"
• UD.DepRel.advmod.toString = "advmod"
• UD.DepRel.discourse.toString = "discourse"
• UD.DepRel.aux.toString = "aux"
• UD.DepRel.auxPass.toString = "aux:pass"
• UD.DepRel.cop.toString = "cop"
• UD.DepRel.mark.toString = "mark"
• UD.DepRel.det.toString = "det"
• UD.DepRel.clf.toString = "clf"
• UD.DepRel.case_.toString = "case"
• UD.DepRel.compound.toString = "compound"
• UD.DepRel.flat.toString = "flat"
• UD.DepRel.fixed.toString = "fixed"
• UD.DepRel.list.toString = "list"
• UD.DepRel.parataxis.toString = "parataxis"
• UD.DepRel.orphan.toString = "orphan"
• UD.DepRel.goesWith.toString = "goeswith"
• UD.DepRel.reparandum.toString = "reparandum"
• UD.DepRel.conj.toString = "conj"
• UD.DepRel.cc.toString = "cc"
• UD.DepRel.punct.toString = "punct"
• UD.DepRel.root.toString = "root"
• UD.DepRel.dep.toString = "dep"

@[instance_reducible]

instance UD.instToStringDepRel : ToString DepRel

Equations

• UD.instToStringDepRel = { toString := UD.DepRel.toString }

def UD.DepRel.isCoreArg : DepRel → Bool

Is this a core argument relation?

Equations

• UD.DepRel.nsubj.isCoreArg = true
• UD.DepRel.nsubjPass.isCoreArg = true
• UD.DepRel.csubj.isCoreArg = true
• UD.DepRel.csubjPass.isCoreArg = true
• UD.DepRel.obj.isCoreArg = true
• UD.DepRel.iobj.isCoreArg = true
• UD.DepRel.ccomp.isCoreArg = true
• UD.DepRel.xcomp.isCoreArg = true
• x✝.isCoreArg = false

def UD.DepRel.isValencyArg : DepRel → Bool

Is this a valency-bearing dependency? Extends isCoreArg with .obl (oblique nominals), which valency frameworks (e.g. [OL23] on dependency-grammar valent typology) treat as a valency role even though UD classifies it as non-core.

Equations

• UD.DepRel.nsubj.isValencyArg = true
• UD.DepRel.nsubjPass.isValencyArg = true
• UD.DepRel.csubj.isValencyArg = true
• UD.DepRel.csubjPass.isValencyArg = true
• UD.DepRel.obj.isValencyArg = true
• UD.DepRel.iobj.isValencyArg = true
• UD.DepRel.ccomp.isValencyArg = true
• UD.DepRel.xcomp.isValencyArg = true
• UD.DepRel.obl.isValencyArg = true
• x✝.isValencyArg = false

def UD.DepRel.isSubject : DepRel → Bool

Is this a subject relation?

Equations

• UD.DepRel.nsubj.isSubject = true
• UD.DepRel.nsubjPass.isSubject = true
• UD.DepRel.csubj.isSubject = true
• UD.DepRel.csubjPass.isSubject = true
• x✝.isSubject = false

def UD.DepRel.isObject : DepRel → Bool

Is this an object relation?

Equations

• UD.DepRel.obj.isObject = true
• UD.DepRel.iobj.isObject = true
• x✝.isObject = false

def UD.DepRel.isModifier : DepRel → Bool

Is this a modifier relation?

Equations

• UD.DepRel.amod.isModifier = true
• UD.DepRel.advmod.isModifier = true
• UD.DepRel.nmod.isModifier = true
• UD.DepRel.nummod.isModifier = true
• UD.DepRel.advcl.isModifier = true
• UD.DepRel.acl.isModifier = true
• x✝.isModifier = false

def UD.DepRel.isFunctionWord : DepRel → Bool

Is this a function word relation?

Equations

• UD.DepRel.aux.isFunctionWord = true
• UD.DepRel.auxPass.isFunctionWord = true
• UD.DepRel.cop.isFunctionWord = true
• UD.DepRel.mark.isFunctionWord = true
• UD.DepRel.det.isFunctionWord = true
• UD.DepRel.case_.isFunctionWord = true
• UD.DepRel.clf.isFunctionWord = true
• x✝.isFunctionWord = false

structure UD.DepArc : Type

A single dependency arc in a UD tree

• dependent : ℕ

  Index of the dependent word (1-indexed)

• head : ℕ

  Index of the head word (0 = root)

• deprel : DepRel

  The dependency relation

def UD.instDecidableEqDepArc.decEq (x✝ x✝¹ : DepArc) : Decidable (x✝ = x✝¹)

Equations

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

@[instance_reducible]

instance UD.instDecidableEqDepArc : DecidableEq DepArc

Equations

• UD.instDecidableEqDepArc = UD.instDecidableEqDepArc.decEq

def UD.instReprDepArc.repr : DepArc → ℕ → Std.Format

Equations

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

@[instance_reducible]

instance UD.instReprDepArc : Repr DepArc

Equations

• UD.instReprDepArc = { reprPrec := UD.instReprDepArc.repr }