1 / 21

Computational Parsing of the Navajo Verb: A Tripartite Structure Approach

This study by Mans Hulden and S.T. Bischoff explores the computational parsing of Navajo verb structures within the framework of linguistics. By employing a tripartite model, the research categorizes verb construction into templates involving outer prefixes, inner prefixes, and classifiers, which encompass plural objects and subject classifiers in both conjunct and disjunct forms. The findings highlight the complexities of verb morphology in Navajo, illustrating how computational methods can effectively address these intricacies while maintaining grammatical consistency.

kaylee
Télécharger la présentation

Computational Parsing of the Navajo Verb: A Tripartite Structure Approach

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computational Parsing of the Navajo Verb by Mans Hulden & S.T. Bischoff mhulden@email.arizona.edu/bischoff@email.arizona.edu SoRiiL(Society for Rational Inquiry in Linguistics) Ling 538 Fall 2006

  2. Tripartite Structure: Templates outer prefix plural object inner prefix subject classifier stem/ mode disjunct conjunct stem Navajo verb tripartite structure: (Young & Morgan 1987, 1993; Faltz 1998; among others)

  3. Tripartite Structure: Templates outer prefix plural object inner prefix subject classifier stem/ mode di + da + y + d + íí + ł + jééʼ disjunct conjunct stem (1) dideidííłjééʼ 'They made a fire.' (Faltz 1998:171.27) NOTE: a phonological rule changes "da + y" to "dei"

  4. Stem sets: Lexical Prefixes outer prefix plural object inner prefix subject classifier stem/ mode disjunct conjunct stem Lexical Prefixes: outer inner ha d na j bik'i '

  5. Dependencies: Subjects sg dpl sg dpl 1 sé siid 1 íí iid 2 síní soo 2 ííní oo 3 s or z 3 íí (z) outer prefix plural object inner prefix subject classifier stem/ mode disjunct conjunct stem A. (mode)P(s):(classifier) 0 / ł B. (mode)P(y):(classifier) 0 / ł conjunct prefix

  6. Dependencies: Subjects outer prefix plural object inner prefix subject classifier stem/ mode yí + 0 + cha[P(y)] disjunct conjunct stem outer prefix plural object inner prefix subject classifier stem/mode sh + 0 + cha[I] disjunct conjunct stem (2) yícha 'I cried.' (P(y) Mode)(Faltz 1998:91) (3) yishcha 'I am crying.' (I mode )(Faltz 1998:55)

  7. outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j íí + 0 + geed[P(y)] disjunct conjunct stem outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z + 0 + geed[P(y)] disjunct conjunct stem Dependencies: Subjects (4) hadajíígeed 'Those guys dug it out.' (5) hadajizgeed 'Those guys dug them out.'

  8. happy+ADJ+SUPER Finite-state transducer happiest happiest yishcha Finite-state abstraction (similar to chapters 3-4 in J&M) English Navajo [0+0|0+0+sh+0^cha]+I+S1 happy+ADJ+SUPER Finite-state transducer Finite-state transducer

  9. Underlying forms [0+0|0+0+sh+0^cha]+I+S1 Morphotactics I-mode S1 subj = sh ... Intermediate forms [0+0|0+0+sh+0^cha] Phonological rules cascade 0 -> yi / ... yishcha Surface forms Computational implementation • Breakup into three components:

  10. A simple example: Prefix … Suffix Prefix n must match Suffix n Long-distance dependencies with FSA Problem: Rules/middle part is duplicated in grammar

  11. Potential solution Need formalism that meets three criteria: • Can be compiled into FSM representation • Can express long-distance relationships in a compact manner, so grammar remains readable • Can be efficiently applied at runtime in case complete FSM compilation turns out to be infeasible once grammar expands

  12. Depencies outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z + 0 + geed[P(y)] disjunct conjunct stem Need concise formalism for describing the dependencies Example: j in object slot is permitted iff subj=3rd person (z)

  13. outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z 0 + geed[P(y)] disjunct conjunct stem Morphotactics: Extended unification scheme Basic unification with OP [FEAT VALUE] ha geed ⊔[MODE yP] ⊔[MODE yP]

  14. outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z 0 + geed[P(y)] disjunct conjunct stem Morphotactics Basic unification with OP [FEAT VALUE] j z ⊔[SUBJ 4] ⊔[SUBJ 4] *Allows for j without z

  15. outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z 0 + geed[P(y)] disjunct conjunct stem Morphotactics Add “+” and “-” operators: j z +[SUBJ 4] ⊔[SUBJ 4] + requires [SUBJ 4] elsewhere

  16. outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z 0 + geed[P(y)] disjunct conjunct stem Morphotactics Add logical connectives: “⋁” and “⋀” j z +[SUBJ 4] ⊔[SUBJ3]v+[SUBJ4]

  17. outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z 0 + geed[P(y)] disjunct conjunct stem Morphotactics Extended unification scheme to avoid complex regular expressions: Operators: {⊔,+, -} (unification, coercion, exclusion) Logical connectives: {⋁,⋀} morphemes carry OP [FEAT VALUE] combinations

  18. outer prefix plural object inner prefix subj clsfr stem/mode ha + da+ 0 + j z 0 + geed[P(y)] disjunct conjunct stem Morpheme order A verb V is an ordered concatenation of morphemes M1,...,Mn We draw morphemes out of bins, one from each:

  19. 0 … Z +[DPL] ⊔[SUBJ 3 v 4] … geed ⊔[MODE yP] … ha ⊔[MODE yP] … da ⊔[DPL] ⊔[DSJNCT 1] … j +[SUBJ 4] … Simple concatenation machine V: Fragment of Unification machine U: ⊔[MODE X] ¬⊔[MODE ¬X] ¬⊔[MODE ] (V ∩ U) = Complete morphotactics

  20. hadajizgeed Complexity • Main grammar without stem-lexicon: ~70000 states as FST • Handles ~8 billion word-forms • Some remaining ambiguity/overgeneration: [ha+da|0j+0+z+0^geed]+Py+S4+DISTPL+O3 [ha+da|0j+0+z+0^geed]+Ps+S4+DISTPL+O3 [ha+da|j+0+z+0^geed]+Ps+S4+DISTPL [ha+da|j+0+z+0^geed]+Py+S4+DISTPL

  21. Thank you! Computational Parsing of the Navajo Verb by Mans Hulden & S.T. Bischoff University of Arizona mhulden@email.arizona.edu/bischoff@email.arizona.edu

More Related