874 research outputs found

    Temiar Reduplication in One-Level Prosodic Morphology

    Full text link
    Temiar reduplication is a difficult piece of prosodic morphology. This paper presents the first computational analysis of Temiar reduplication, using the novel finite-state approach of One-Level Prosodic Morphology originally developed by Walther (1999b, 2000). After reviewing both the data and the basic tenets of One-level Prosodic Morphology, the analysis is laid out in some detail, using the notation of the FSA Utilities finite-state toolkit (van Noord 1997). One important discovery is that in this approach one can easily define a regular expression operator which ambiguously scans a string in the left- or rightward direction for a certain prosodic property. This yields an elegant account of base-length-dependent triggering of reduplication as found in Temiar.Comment: 9 pages, 2 figures. Finite-State Phonology: SIGPHON-2000, Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology, pp.13-21. Aug. 6, 2000. Luxembour

    Earlier Egyptian passive forms associated with reduplication

    Get PDF

    The Templatic Syllable Patterns of Reduplication and Stem-affixing Inflections in the Classical Arabic Based on Prosodic Morphology Theory

    Get PDF
    A morpheme, is a set of feature matrices dominated by a single node. Reduplication or gemination is one of the productive morphological processes which have been studied inclusively in different languages and in the frame of different linguistic theories like Generative Grammar, Optimality Theory and Minimalist Program. McCarthy's prosodic theory is justified by an analysis of the formal properties of the system of verbal processes like reduplication are the primary or sole morphological operations. This theory of nonconcatenative morphology recognizing the root as a discontinuous constituent. Under the prosodic model, a morphological category which characteristically reduplicates simply stipulates an output template composed of vowel and consonant. Consonantal roots and vocalic melodies in Arabic, although they contain bundles of the same distinctive features, can nevertheless be represented on separate autosegmental tiers. This ensures that the association conventions for melodies can operate independently on these two tiers. Association of autosegments from different tiers to the same segments will be subject to the natural restriction that no segment receives multiple associations for the same nontonal feature

    Taking Primitive Optimality Theory Beyond the Finite State

    Full text link
    Primitive Optimality Theory (OTP) (Eisner, 1997a; Albro, 1998), a computational model of Optimality Theory (Prince and Smolensky, 1993), employs a finite state machine to represent the set of active candidates at each stage of an Optimality Theoretic derivation, as well as weighted finite state machines to represent the constraints themselves. For some purposes, however, it would be convenient if the set of candidates were limited by some set of criteria capable of being described only in a higher-level grammar formalism, such as a Context Free Grammar, a Context Sensitive Grammar, or a Multiple Context Free Grammar (Seki et al., 1991). Examples include reduplication and phrasal stress models. Here we introduce a mechanism for OTP-like Optimality Theory in which the constraints remain weighted finite state machines, but sets of candidates are represented by higher-level grammars. In particular, we use multiple context-free grammars to model reduplication in the manner of Correspondence Theory (McCarthy and Prince, 1995), and develop an extended version of the Earley Algorithm (Earley, 1970) to apply the constraints to a reduplicating candidate set.Comment: 11 pages, 5 figures, worksho

    Computational Locality in Morphological Maps

    Get PDF
    corecore