English
Related papers

Related papers: Uzbek affix finite state machine for stemming

200 papers

We present an unsupervised and language-agnostic method for learning root-and-pattern morphology in Semitic languages. This form of morphology, abundant in Semitic languages, has not been handled in prior unsupervised approaches. We harness…

Computation and Language · Computer Science 2017-02-14 Tarek Sakakini , Suma Bhat , Pramod Viswanath

Urdu is a challenging language because of, first, its Perso-Arabic script and second, its morphological system having inherent grammatical forms and vocabulary of Arabic, Persian and the native languages of South Asia. This paper describes…

Computation and Language · Computer Science 2022-04-08 Muhammad Humayoun , Harald Hammarström , Aarne Ranta

In Linguistics, a grapheme is a written unit of a writing system corresponding to a phonological sound. In Natural Language Processing tasks, written language is analysed through two different mediums, word analysis, and character analysis.…

Computation and Language · Computer Science 2024-04-03 Samuel Rose , Chandrasekhar Kambhampati

Ge'ez is an ancient Semitic language renowned for its unique alphabet. It serves as the script for numerous languages, including Tigrinya and Amharic, and played a pivotal role in Ethiopia's cultural and religious development during the…

Computation and Language · Computer Science 2025-09-25 Gebrearegawi Gebremariam , Hailay Teklehaymanot , Gebregewergs Mezgebe

Urdu is a combination of several languages like Arabic, Hindi, English, Turkish, Sanskrit etc. It has a complex and rich morphology. This is the reason why not much work has been done in Urdu language processing. Stemming is used to convert…

Computation and Language · Computer Science 2013-10-03 Vaishali Gupta , Nisheeth Joshi , Iti Mathur

Common subword tokenization algorithms like BPE and UnigramLM assume that text can be split into meaningful units by concatenative measures alone. This is not true for languages such as Hebrew and Arabic, where morphology is encoded in…

Computation and Language · Computer Science 2025-06-04 Bar Gazit , Shaltiel Shmidman , Avi Shmidman , Yuval Pinter

Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators, including many large-scale commercial systems. However, it…

Computation and Language · Computer Science 2009-09-25 Kenneth R. Beesley , Lauri Karttunen

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

We present a stochastic finite-state model for segmenting Chinese text into dictionary entries and productively derived words, and providing pronunciations for these words; the method incorporates a class-based model in its treatment of…

cmp-lg · Computer Science 2008-02-03 Richard Sproat , Chilin Shih , William Gale , Nancy Chang

Semantic relatedness between words is one of the core concepts in natural language processing, thus making semantic evaluation an important task. In this paper, we present a semantic model evaluation dataset: SimRelUz - a collection of…

Computation and Language · Computer Science 2022-05-13 Ulugbek Salaev , Elmurod Kuriyozov , Carlos Gómez-Rodríguez

Arabic morphology encapsulates many valuable features such as word root. Arabic roots are being utilized for many tasks; the process of extracting a word root is referred to as stemming. Stemming is an essential part of most Natural…

Computation and Language · Computer Science 2016-11-02 Mahmoud El-Defrawy , Yasser El-Sonbaty , Nahla A. Belal

This paper presents a method of stemming for the Arabian texts based on the linguistic techniques of the natural language processing. This method leans on the notion of scheme (one of the strong points of the morphology of the Arabian…

Computation and Language · Computer Science 2019-11-19 Sadik Bessou , Mohamed Louail , Allaoua Refoufi , Zehour Kadem , Mohamed Touahria

Hybrid approaches for automatic vowelization of Arabic texts are presented in this article. The process is made up of two modules. In the first one, a morphological analysis of the text words is performed using the open source morphological…

Computation and Language · Computer Science 2014-10-13 Mohamed Bebah , Chennoufi Amine , Mazroui Azzeddine , Lakhouaja Abdelhak

This paper proposes a framework to improve the typing experience of mobile users in morphologically rich languages. Smartphone keyboards typically support features such as input decoding, corrections and predictions that all rely on…

Computation and Language · Computer Science 2022-01-19 Andreas Kabel , Keith Hall , Tom Ouyang , David Rybach , Daan van Esch , Françoise Beaufays

Determinization of fuzzy finite automata is understood here as a procedure of their conversion into equivalent crisp-deterministic fuzzy automata, which can be viewed as being deterministic with possibly infinitely many states, but with…

Formal Languages and Automata Theory · Computer Science 2014-12-17 Ivana Micić , Zorana Jančić , Jelena Ignjatović , Miroslav Ćirić

Stemming or suffix stripping, an important part of the modern Information Retrieval systems, is to find the root word (stem) out of a given cluster of words. Existing algorithms targeting this problem have been developed in a haphazard…

Information Retrieval · Computer Science 2013-12-25 B. P. Pande , Pawan Tamta , H. S. Dhami

Morphological parsing is the task of decomposing words into morphemes, the smallest units of meaning in a language, and labelling their grammatical roles. It is a particularly challenging task for agglutinative languages, such as the Nguni…

Computation and Language · Computer Science 2025-05-20 Cael Marquard , Simbarashe Mawere , Francois Meyer

Semitic languages can be highly ambiguous, having several interpretations of the same surface forms, and morphologically rich, having many morphemes that realize several morphological features. This is further exacerbated for dialectal…

Computation and Language · Computer Science 2019-10-08 Nasser Zalmout , Nizar Habash

Spell correction is used to detect and correct orthographic mistakes in texts. Most of the time, traditional dictionary lookup with string similarity methods is suitable for the languages that have a less complex structure such as the…

Computation and Language · Computer Science 2021-02-08 Ahmad Ahmadzade , Saber Malekzadeh

In this paper, we show that the multiple-stem approach to nouns with a broken plural pattern allows for greater generalizations to be stated in the morphological system. Such an approach dispenses with truncating/deleting rules and other…

Computation and Language · Computer Science 2024-05-21 Abdelhadi Soudi , Violetta Cavalli-Sforza , Abderrahim Jamari