complexity-based ordering approach

Affix ordering is a theoretical discussion in morphology. There has been some debate over the existence of general principles or mechanisms governing affix ordering. In this regard, we can point to three principal approaches. The first approach named the stratum-oriented model (Siegel, 1974; Allen, 1978; Kiparsky, 1982; Mohanan, 1986), believes that lexicon has a layered structure and can determine the affixes' combinations. The second approach relies on Selectional Restrictions' affix oriented (Fabb, 1988; Plag, 1999). These restrictions include restrictions of the group of affixes and phonological, morphological, semantic, and syntax restrictions. This approach claims that the description of possible and impossible combinations of affixes is related to describing the functions of restrictions. The third approach formed the theoretical framework of the present study by providing a psycho-linguistic model based on this idea that the affix ordering is a function of the degree of parsability of affixes from their bases (Hay 2000; 2002). According to this approach, affixes parsed easily in language processing cannot stay near the base relative to the affixes with a lower degree of parsability. Plag (2003) called the approach as Complexity-Based Ordering (CBO). The question is that how can we describe the Persian derivational prefixes ordering based on the CBO framework. For this reason, by selecting 17 prefixes 2200 derivational words extracted from database. By considering prefixes co-occurrences the rank of each prefix was obtained by using directed-graph and upper triangle square matrixes. According to this theoretical framework, by using frequency of derivational words and bases we could draw the scatter plot and determined the rank of type and token frequency ratio. Finally, according to data and by using the rank of parsability, type and token frequency ratio, we assessed the continuum of Persian prefixes ordering. Similar to Hay and Plag (2004) findings, this approach can describe Persian prefixes ordering as well as English affixes ordering

Affix ordering is a theoretical discussion in morphology. There has been some debate over the existence of general principles or mechanisms governing affix ordering. In this regard, we can point to three principal approaches. The first approach named the stratum-oriented model (Siegel, 1974; Allen, 1978; Kiparsky, 1982; Mohanan, 1986), believes that lexicon has a layered structure and can determine the affixes' combinations. The second approach relies on Selectional Restrictions' affix oriented (Fabb, 1988; Plag, 1999). These restrictions include restrictions of the group of affixes and phonological, morphological, semantic, and syntax restrictions. This approach claims that the description of possible and impossible combinations of affixes is related to describing the functions of restrictions. The third approach formed the theoretical framework of the present study by providing a psycho-linguistic model based on this idea that the affix ordering is a function of the degree of parsability of affixes from their bases (Hay 2000; 2002). According to this approach, affixes parsed easily in language processing cannot stay near the base relative to the affixes with a lower degree of parsability. Plag (2003) called the approach as Complexity-Based Ordering (CBO). The question is that how can we describe the Persian derivational prefixes ordering based on the CBO framework. For this reason, by selecting 17 prefixes 2200 derivational words extracted from database. By considering prefixes co-occurrences the rank of each prefix was obtained by using directed-graph and upper triangle square matrixes. According to this theoretical framework, by using frequency of derivational words and bases we could draw the scatter plot and determined the rank of type and token frequency ratio. Finally, according to data and by using the rank of parsability, type and token frequency ratio, we assessed the continuum of Persian prefixes ordering. Similar to Hay and Plag (2004) findings, this approach can describe Persian prefixes ordering as well as English affixes ordering

The present research studies the derivational suffixes ordering constraints in Persian in Complexity-based Ordering Approach. The corpus based on which this research is conducted is the data of the Institute for Humanities and Cultural Studies. To conduct this study, 8 Persian suffixes were selected and ranked in a hierarchy-based ordering in Complexity-based Ordering Approach, then the correlation between their ranks in the hierarchy and their productivity, parsing ratios and boundary strengths were evaluated. Also, the correlation between the suffixes positions in graphical hierarchy, with their productivity, parsing ratios and boundary strengths were evaluated. The results show that there is no meaningful correlation between the suffixes ranks in the hierarchy-based ordering in Complexity-based Ordering Approach and their position in the graphical hierarchy, their productivity, parsing ratios and boundary strengths.