نتایج جستجو برای: infixes

تعداد نتایج: 36  

2004
Alan C. L. Yu

A survey of 141 infixation patterns from more than 100 languages revealed that infixes invariably appear near the one of the edges of a stem or next to a stressed unit. However, more than 126 cases of these infixes (i.e. 91%) are edge-oriented. This asymmetric distribution of infixes is referred to as the Edge Bias Effect. Recent work in OT attempts to explain this edge bias in terms of the Dis...

2009
Craig Kopris

A cross-linguistically very rare type of clitic, the endoclitic, occurs in Pashto. Like infixes, endoclitics can be inserted inside of a word, but by splitting words apart into separate nonadjacent pieces which themselves might not have any meaning. Unlike infixes, however, endoclitics are not inflections; their meaning is unrelated to that of their host word. This paper discusses some of the p...

Journal: :Proceedings of the annual meetings on phonology 2023

In this paper, I present novel evidence supporting the claim that there are no right-edge infixes. Based on a typological survey, demonstrate all putative infixes only surface in languages with prosodic prominences. It is therefore possible to reanalyze as prominence-oriented Infixes, result, highly asymmetric: they can occur left edge of stem or prosodically prominent position, but nowhere els...

Journal: :The American Journal of Semitic Languages and Literatures 1908

Journal: :Int. Arab J. Inf. Technol. 2015
Sajjad Khan Waqas Anwar Xuan Wang Usama Ijaz Bajwa

Word stemming is one of the most significant factors that affect the performance of a Natural Language Processing (NLP) application such as Information Retrieval (IR) system, part of speech tagging, machine translation system and syntactic parsing. Urdu language raises several challenges to NLP largely due to its rich morphology. In Urdu language, stemming process is different as compared to th...

2000
Anne N. De Roeck Waleed Al-Fares

We present a clustering algorithm for Arabic words sharing the same root. Root based clusters can substitute dictionaries in indexing for IR. Modifying Adamson and Boreham (1974), our Two-stage algorithm applies light stemming before calculating word pair similarity coefficients using techniques sensitive to Arabic morphology. Tests show a successful treatment of infixes and accurate clustering...

Journal: :English Language and Linguistics 2023

English words containing inserted expletives, like absobloodylutely or unbefuckinglievable , are often said to be created by ‘infixation’. One goal of this work is argue that such claims self-contradictory. Infixes affixes, but the expletives not. Rather, they themselves morphologically complex, not bound, and can occur with from different syntactic categories. Hence, full words, only property ...

Journal: :iranian journal of applied language studies 2014
abbas ali ahangar moosa mahmoodzahi farzaneh jamalzahi

sarhaddi balochi dialect, a language variety of western (rakhshani) balochi, employs derivation through affixation as one of its word formation processes. the purpose of this article is to present a synchronic description of the way(s) different derivational affixes function in making complex words in sarhaddi balochi as spoken in granchin[1] district located about 35kms to the southeast of kha...

Journal: :CoRR 2016
Javid Dadashkarimi Hossein Nasr Esfahani Heshaam Faili Azadeh Shakery

There have been multiple attempts to resolve various inflection matching problems in information retrieval. Stemming is a common approach to this end. Among many techniques for stemming, statistical stemming has been shown to be effective in a number of languages, particularly highly inflected languages. In this paper we propose a method for finding affixes in different positions of a word. Com...

2012
Ludwig Staiger

The subword complexity of an infinite word ξ is a function f (ξ, n) returning the number of finite subwords (factors, infixes) of length n of ξ. In the present paper we investigate infinite words for which the set of subwords occurring infinitely often is a regular language. Among these infinite words we characterise those which are eventually recurrent. Furthermore, we derive some results comp...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید