A finite-state approach to arabic broken noun morphology

In this paper, a finite-state computational approach to Arabic broken plural noun morphology is introduced. The paper considers the derivational aspect of the approach, and how generalizations about dependencies in the broken plural noun derivational system of Arabic are captured and handled computationally in this finite-state approach. The approach will be implemented using Xerox finite-state tool

Finite-State Locality in Semitic Root-and-Pattern Morphology

This paper discusses the generative capacity required for Semitic root-and-pattern morphology. Finite-state methods effectively compute concatenative morpho-phonology, and can be restricted to Strictly Local functions. We extend these methods to consider non-concatenative morphology. We show that over such multi-input functions, Strict Locality is necessary and sufficient. We discuss some consequences of this generalization for linguistic theories of the morphological template

Addressing the Challenges of Igbo Computational Morphological Studies Using Frequent Pattern-Based Induction

Computational studies of Igbo language are constrained by non-availability of large electronic corpora of Igbo text, a prerequisite for data-driven morphological induction. Existing unsupervised models, which are frequent-segment based, do not sufficiently address non-concatenative morphology and cascaded affixation prevalent in Igbo morphology, as well achieving affix labelling. This study devised a data-driven model that could induce non-concatenative aspects of Igbo morphology, cascaded affixation and affix labelling using frequent pattern-based induction. Ten-fold Cross Validation (TCV) test was used to validate the propositions using percentages. An average accuracy measure of 88% was returned for the developed model. Ten purposively selected Igbo first speakers also evaluated samples of 100 model-analysed words each and the mean accuracy score of 82% was recorded. We conclude that morphology induction can be realized with a modestly sized corpus, demonstrating that electronic corpora scarcity does not constrain computational morphology studies as it would other higher levels of linguistic analysis

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

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

Multi-Input Strictly Local Functions for Templatic Morphology

This paper presents an automata-theoretic characterization of templatic morphology. We generalize the Input Strictly Local class of functions, which characterize a majority of concatenative morphology, to consider multiple lexical inputs. We show that strictly local asynchronous multi-tape transducers successfully capture this typology of nonconcatenative template filling. This characterization and restriction uniquely opens up representational issues in morphological computatio

Temiar Reduplication in One-Level Prosodic Morphology

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