• Back to Latvian-LVTB page

    • Token Distribution across Case

    The following histogram captures the token distribution per different part-of-speech (POS) tags.

    Legend on the top-right shows the different values the Case attribute takes.
    'NA' denotes those tokens which do not possess the Case attribute.

    Case

    Token examples for each POS:

     NOUN       PUNCT       VERB       PRON       ADV       ADJ       PROPN       ADP       CCONJ       AUX       DET       SCONJ       PART       NUM       X       SYM       INTJ      

    Case agreement rules:

    The following decision tree visualizes the rules used for classifying presence/absence of morphological agreement between two tokens that are connected by a dependency relation denoted by relation. head-pos and child-pos refer to the POS tag of the head and child token respectively.

    Each node of the tree represents a portion of the data. samples denotes the number of training data points in that node. value is the class distribution within that node. Each edge denotes the feature used for splitting.
    Leaf nodes contain the description of all of the features that appear in that leaf. * denotes that the feature can take any value.

    Tree for p=0.01

    Click on to show summary of agreement rules.

    1. ADJ tokens agree with their head for the dependency relations: anything(None)

    2. DET tokens agree with their head for the dependency relations: determiner(det)

    3. NOUN tokens agree with their head for the dependency relations: conjunct(conj)

    4. VERB tokens agree with their head for the dependency relations: overridden disfluency(reparandum), underspecified dependency(udep), complement for auxiliary(comp:aux), modifer(mod), orphan(orphan), complement for auxiliary(comp:aux@pass), predicative complements(comp:pred), subject(subj@pass)

    5. All tokens agree with their head tokens for the dependency relations: subject (subj), parataxis (parataxis)

    6. PROPN tokens agree when the dependent token belongs to [PROPN] for the dependency relations: flat multiword expression(flat@name)

    7. NOUN tokens agree when the dependent token belongs to [NOUN] for the dependency relations: appositional modifier(appos)

    8. PRON tokens agree with their head for the dependency relations: compound(compound)

    9. NUM tokens agree with their head for the dependency relations: oblique complements(comp:obl), unk(unk)

    10. PROPN tokens agree when the dependent token belongs to [NOUN] for the dependency relations: discourse element(discourse)

    Case

    Examples for each leaf node:

     Leaf-0       Leaf-1       Leaf-2       Leaf-3       Leaf-4       Leaf-5       Leaf-6       Leaf-7       Leaf-8       Leaf-9       Leaf-10       Leaf-11       Leaf-12       Leaf-13       Leaf-14      

    Click on to expand the tree.