Computational Nonlinear Morphology: With Emphasis on Semitic Languages
By the late 1970s phonologists, and later morphologists, had departed from a linear approach for describing morphophonological operations to a nonlinear one. Computational models, however, remain faithful to the linear model, making it very difficult, if not impossible, to implement the morphology of languages whose morphology is nonconcatanative. Computational Nonlinear Morphology aims at presenting a computational system that counters the development in linguistics. It provides a detailed computational analysis of the complex morphophonological phenomena found in Semitic languages based on linguistically motivated models.
What people are saying - Write a review
We haven't found any reviews in the usual places.
1see Section 1the accepts affix alphabet analysis applies Arabic automaton autosegmental autosegmental phonology bimoraic broken plural circumfixation compilation Computational Linguistics computational morphology concatenation consonant context,free cross product cvcvc Definition deletion denoted depicted in Fig derived described elements example finite,state automata formalism FSTs glyph grammar iambic template input insertion intersection k t b katab kernel Kiraz Kleene star kpolo ktab kutib lexical entries lexical expressions lexical forms lexical representation lexical,surface subsequences lexicon linear machine maps measure morae morphology morphotactics muhitape n,way nominal nonlinear morphology noun operator pair partition pattern morpheme phonological prefix prosodic circumscription quadriliteral regular expression regular languages represents resuh rewrite rules rewrite rules component right context same,length sanction scans segments Semitic languages Semitic morphology sequence singular stem sublexica sublexicon suffix surface string Syriac tier transducer transitions triliteral tuple of strings two,level tuple verb vowel word