首页/论文/2005.10652

arXiv 2005.106522020-05-21cs.CL

Towards Finite-State Morphology of Kurdish

Insight Centre for Data Analytics, National University of Ireland Galway（爱尔兰国立大学戈尔韦分校Insight数据分析中心）；University of Kurdistan Hewlêr（库尔德斯坦埃尔比勒大学）

Sina Ahmadi, Hossein Hassani

备注：: Manuscript submitted to ACM-TALLIP

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

Morphological analysis is the study of the formation and structure of words. It plays a crucial role in various tasks in Natural Language Processing (NLP) and Computational Linguistics (CL) such as machine translation and text and speech generation. Kurdish is a less-resourced multi-dialect Indo-European language with highly inflectional morphology. In this paper, as the first attempt of its kind, the morphology of the Kurdish language (Sorani dialect) is described from a computational point of view. We extract morphological rules which are transformed into finite-state transducers for generating and analyzing words. The result of this research assists in conducting studies on language generation for Kurdish and enhances the Information Retrieval (IR) capacity for the language while leveraging the Kurdish NLP and CL into a more advanced computational level.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A Formal Description of Sorani Kurdish Morphology

Insight Centre for Data Analytics（数据分析洞察中心）；National University of Ireland Galway（爱尔兰国立大学戈尔韦分校）

Sorani Kurdish, also known as Central Kurdish, has a complex morphology, particularly due to the patterns in which morphemes appear. Although several aspects of Kurdish morphology have been studied, such as pronominal endoclitics and Izafa constructions, Sorani Kurdish morphology has received trivial attention in computational linguistics. Moreover, some morphemes, such as the emphasis endoclitic =îş, and derivational morphemes have not been previously studied. To tackle the complex morphology of Sorani, we provide a thorough description of Sorani Kurdish morphological and morphophonological c…

2021-09-08cs.CL

KurdSTS: 亚美尼亚语语义文本相似性

KurdSTS: The Kurdish Semantic Textual Similarity

Artificial Intelligence and Innovation Centre, University of Kurdistan Hewler（库尔德斯坦赫勒大学人工智能与创新中心）；Soran University（索兰大学）；University of Tehran（德黑兰大学）

本文提出了首个库尔德语语义文本相似性数据集，并评估了多种基线模型，揭示了库尔德语在形态学、正字法和代码混合方面的挑战。

2025-11-27cs.AIcs.CL

CKMorph: A Comprehensive Morphological Analyzer for Central Kurdish

Sharif University of Technology（谢里夫理工大学）；University of Tehran（德黑兰大学）；Ryerson University（瑞尔森大学）；Avignon University（阿维尼翁大学）

A morphological analyzer, which is a significant component of many natural language processing applications especially for morphologically rich languages, divides an input word into all its composing morphemes and identifies their morphological roles. In this paper, we introduce a comprehensive morphological analyzer for Central Kurdish (CK), a low-resourced language with a rich morphology. Building upon the limited existing literature, we first assembled and systematically categorized a comprehensive collection of the morphological and morphophonological rules of the language. Additionally, w…

2022-03-02cs.CL

Finite-State Reduplication in One-Level Prosodic Morphology

Reduplication, a central instance of prosodic morphology, is particularly challenging for state-of-the-art computational morphology, since it involves copying of some part of a phonological string. In this paper I advocate a finite-state method that combines enriched lexical representations via intersection to implement the copying. The proposal includes a resource-conscious variant of automata and can benefit from the existence of lazy algorithms. Finally, the implementation of a complex case from Koasati is presented.

2000-05-22cs.CL

One-Level Prosodic Morphology

Recent developments in theoretical linguistics have lead to a widespread acceptance of constraint-based analyses of prosodic morphology phenomena such as truncation, infixation, floating morphemes and reduplication. Of these, reduplication is particularly challenging for state-of-the-art computational morphology, since it involves copying of some part of a phonological string. In this paper I argue for certain extensions to the one-level model of phonology and morphology (Bird & Ellison 1994) to cover the computational aspects of prosodic morphology using finite-state methods. In a nutshell, e…

1999-11-19cs.CL

Computing Declarative Prosodic Morphology

This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a restrictive incremental optimization mechanism. The new approach is illustrated with an implemented fragment of Modern Hebrew verbs couched in MicroCUF, an expressive constraint logic formalism. For generation and parsing of word forms, I propose a novel off-line technique to eliminate run-time optimization. It produces a finite-state oracle that efficiently restricts the constraint interpreter's search space. As a bypr…

1998-09-25cs.CL

更多相关论文收起更多论文

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…

2000-08-18cs.CL

Morphological Analysis of the Bishnupriya Manipuri Language using Finite State Transducers

Tezpur University（提兹普尔大学）

In this work we present a morphological analysis of Bishnupriya Manipuri language, an Indo-Aryan language spoken in the north eastern India. As of now, there is no computational work available for the language. Finite state morphology is one of the successful approaches applied in a wide variety of languages over the year. Therefore we adapted the finite state approach to analyse morphology of the Bishnupriya Manipuri language.

2014-04-22cs.CL

Morphology Matters: A Multilingual Language Modeling Analysis

University of Illinois（伊利诺伊大学）；Carnegie Mellon University（卡内基梅隆大学）；Johns Hopkins University（约翰斯·霍普金斯大学）；Indiana University（印第安纳大学）；University of Chicago（芝加哥大学）；University of Colorado Boulder（科罗拉多大学博尔德分校）

Prior studies in multilingual language modeling (e.g., Cotterell et al., 2018; Mielke et al., 2019) disagree on whether or not inflectional morphology makes languages harder to model. We attempt to resolve the disagreement and extend those studies. We compile a larger corpus of 145 Bible translations in 92 languages and a larger number of typological features. We fill in missing typological data for several languages and consider corpus-based measures of morphological complexity in addition to expert-produced typological features. We find that several morphological measures are significantly a…

2020-12-11cs.CL

An implementation of Apertium based Assamese morphological analyzer

Gauhati University（高哈蒂大学）

Morphological Analysis is an important branch of linguistics for any Natural Language Processing Technology. Morphology studies the word structure and formation of word of a language. In current scenario of NLP research, morphological analysis techniques have become more popular day by day. For processing any language, morphology of the word should be first analyzed. Assamese language contains very complex morphological structure. In our work we have used Apertium based Finite-State-Transducers for developing morphological analyzer for Assamese Language with some limited domain and we get 72.7…

2015-03-13cs.CL

面向泰米尔语语言模型的形态学感知可逆语义分词与分层词组合

Morphology Aware Reversible Semantic Tokenization and Hierarchical Word Composition for Tamil Language Models

该研究针对泰米尔语，提出结合ThamizhiMorph的形态系统与分层词组合方法，在固定小模型预算下提升翻译性能，同时大幅降低序列长度与推理成本。

2026-08-04cs.CL

东干语的形态核心：双方言有限状态模型与多体裁评估

The Morphological Core of Dungan: A Two-Dialect Finite-State Model and a Multi-Genre Evaluation

St. Petersburg Department of the Steklov Mathematical Institute, RAS（俄罗斯科学院斯特克洛夫数学研究所圣彼得堡分部）；St. Petersburg State University（圣彼得堡国立大学）；Kyrgyz State Technical University named after I. Razzakov（伊·拉扎科夫命名的吉尔吉斯斯坦国立技术大学）

本文构建了覆盖东干语甘肃、陕西两个方言的HFST有限状态形态分析器，通过三种体裁语料评估其形态属性，明确了东干语形态的核心特征与词汇层面的研究空间。

2026-08-03cs.CL

保留语素：面向尼泊尔语的形态学引导预分词

Preserving Morphemes: Morphology-Guided Pre-Tokenization for Nepali

Kathmandu University（加德满都大学）；IOE Thapathali Campus（IOE塔帕塔利校区）

本研究提出形态学引导的预分词器Papaya，在BPE前拆分尼泊尔语单词为词干和词缀，以保留语素完整性，在分词和语言建模上略有提升，但下游任务影响有限。

2026-09-29cs.CL

Error-tolerant Finite State Recognition with Applications to Morphological Analysis and Spelling Correction

Error-tolerant recognition enables the recognition of strings that deviate mildly from any string in the regular set recognized by the underlying finite state recognizer. Such recognition has applications in error-tolerant morphological processing, spelling correction, and approximate string matching in information retrieval. After a description of the concepts and algorithms involved, we give examples from two applications: In the context of morphological analysis, error-tolerant recognition allows misspelled input word forms to be corrected, and morphologically analyzed concurrently. We pres…

1995-07-21cmp-lgcs.CL

从形式语言理论到统计学习：子正则语言的有限可观察性

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages

The University of Tokyo（东京大学）；Nara Institute of Science and Technology（奈良科学技術大学）

研究证明标准子正则语言类在用决定谓词表示时线性可分离，保证了简单线性模型的可学习性，并通过实验验证了其在自然语言建模中的有效性。

2026-03-13cs.CLcs.FLcs.LG

使用波你尼语音系统与有限状态机比较口语

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines

Cambridge Institute of Technology（剑桥理工学院）；Jain University（耆那大学）

本文利用波你尼语音系统构建语音图，将跨语言词汇表示为状态转换并构建形态有限自动机，提出以梵语为核心的语言发展生态系统模型，重新审视语系假说。

2025-07-11cs.CLcs.FL