English
Related papers

Related papers: Using Multiple Sources of Information for Constrai…

200 papers

Tokenization shapes how language models perceive morphology and meaning in NLP, yet widely used frequency-driven subword tokenizers (e.g., Byte Pair Encoding and WordPiece) can fragment morphologically rich and agglutinative languages in…

Computation and Language · Computer Science 2026-04-01 M. Ali Bayram , Ali Arda Fincan , Ahmet Semih Gümüş , Sercan Karakaş , Banu Diri , Savaş Yıldırım , Demircan Çelik

This paper presents an approach to spelling correction in agglutinative languages that is based on two-level morphology and a dynamic programming based search algorithm. Spelling correction in agglutinative languages is significantly…

cmp-lg · Computer Science 2008-02-03 Kemal Oflazer

Neural machine translation (NMT) has achieved impressive performance on machine translation task in recent years. However, in consideration of efficiency, a limited-size vocabulary that only contains the top-N highest frequency words are…

Computation and Language · Computer Science 2020-01-07 Yirong Pan , Xiao Li , Yating Yang , Rui Dong

Morphologically rich languages accentuate two properties of distributional vector space models: 1) the difficulty of inducing accurate representations for low-frequency word forms; and 2) insensitivity to distinct lexical relations that…

Computation and Language · Computer Science 2017-06-02 Ivan Vulić , Nikola Mrkšić , Roi Reichart , Diarmuid Ó Séaghdha , Steve Young , Anna Korhonen

In this paper, we build morphological chains for agglutinative languages by using a log-linear model for the morphological segmentation task. The model is based on the unsupervised morphological segmentation system called MorphoChains. We…

Computation and Language · Computer Science 2017-05-08 Serkan Ozen , Burcu Can

Data augmentation techniques are widely used in low-resource automatic morphological inflection to overcome data sparsity. However, the full implications of these techniques remain poorly understood. In this study, we aim to shed light on…

Computation and Language · Computer Science 2023-10-25 Farhan Samir , Miikka Silfverberg

Inflection is an essential part of every human language's morphology, yet little effort has been made to unify linguistic theory and computational methods in recent years. Methods of string manipulation are used to infer inflectional…

Computation and Language · Computer Science 2020-09-07 Eleni Metheniti , Guenter Neumann , Josef van Genabith

Transformers have achieved state-of-the-art performance in morphological inflection tasks, yet their ability to generalize across languages and morphological rules remains limited. One possible explanation for this behavior can be the…

Computation and Language · Computer Science 2025-06-03 Gal Astrach , Yuval Pinter

All natural language processing systems (such as parsers, generators, taggers) need to have access to a lexicon about the words in the language. This thesis presents a lexicon architecture for natural language processing in Turkish. Given a…

cmp-lg · Computer Science 2008-02-03 Abdullah Kurtulus Yorulmaz

Lexical ambiguity makes it difficult to compute various useful statistics of a corpus. A given word form might represent any of several morphological feature bundles. One can, however, use unsupervised learning (as in EM) to fit a model…

Computation and Language · Computer Science 2020-02-26 Ryan Cotterell , Christo Kirov , Sabrina J. Mielke , Jason Eisner

Tokenization is a pivotal design choice for neural language modeling in morphologically rich languages (MRLs) such as Turkish, where productive agglutination challenges both vocabulary efficiency and morphological fidelity. Prior studies…

Computation and Language · Computer Science 2026-02-09 Duygu Altinok

Lexical ambiguity, a challenging phenomenon in all natural languages, is particularly prevalent for languages with diacritics that tend to be omitted in writing, such as Arabic. Omitting diacritics leads to an increase in the number of…

Computation and Language · Computer Science 2019-12-11 Sawsan Alqahtani , Hanan Aldarmaki , Mona Diab

In this thesis, I address the problem of automatically acquiring lexical semantic knowledge, especially that of case frame patterns, from large corpus data and using the acquired knowledge in structural disambiguation. The approach I adopt…

Computation and Language · Computer Science 2007-05-23 Hang LI

Large Language Models (LLMs) have shown significant progress on various multilingual benchmarks and are increasingly used to generate and evaluate text in non-English languages. However, while they may produce fluent outputs, it remains…

Computation and Language · Computer Science 2025-07-01 Mohammed J. Saeed , Tommi Vehvilainen , Evgeny Fedoseev , Sevil Caliskan , Tatiana Vodolazova

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…

Computation and Language · Computer Science 2007-05-23 Markus Walther

The lack or absence of parallel and comparable corpora makes bilingual lexicon extraction a difficult task for low-resource languages. The pivot language and cognate recognition approaches have been proven useful for inducing bilingual…

Computation and Language · Computer Science 2020-10-07 Arbi Haza Nasution , Yohei Murakami , Toru Ishida

Self-supervised objectives have driven major advances in NLP by leveraging large-scale unlabeled data, but such resources are scarce for many of the world's languages. Surprisingly, they have not been explored much for character-level…

Computation and Language · Computer Science 2025-06-06 Adam Wiemerslage , Katharina von der Wense

We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disambiguation. We view this problem as that of estimating a…

cmp-lg · Computer Science 2007-05-23 Hang Li , Naoki Abe

Memorization in large language models has been studied almost exclusively through prefix-conditioned extraction, a natural choice for autoregressive models. However, diffusion language models (DLMs) can denoise masked tokens at arbitrary…

Computation and Language · Computer Science 2026-05-26 Yihan Wang , N. Asokan

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…

cmp-lg · Computer Science 2008-02-03 Kemal Oflazer