English
Related papers

Related papers: Comparing morphological complexity of Spanish, Oto…

200 papers

Languages can encode temporal subordination lexically, via subordinating conjunctions, and morphologically, by marking the relation on the predicate. Systematic cross-linguistic variation among the former can be studied using…

Computation and Language · Computer Science 2024-07-31 Nilo Pedrazzini

A language $L$ is the orthogonal catenation of languages $L_1$ and $L_2$ if every word of $L$ can be written in a unique way as a catenation of a word in $L_1$ and a word in $L_2$. We establish a tight bound for the state complexity of…

Formal Languages and Automata Theory · Computer Science 2009-04-23 Mark Daley , Michael Domaratzki , Kai Salomaa

Languages vary widely in how meanings map to word forms. These mappings have been found to support efficient communication; however, this theory does not account for systematic relations within word forms. We examine how a restricted set of…

Computation and Language · Computer Science 2026-01-27 Doreen Osmelak , Yang Xu , Michael Hahn , Kate McCurdy

We study the fractal structure of language, aiming to provide a precise formalism for quantifying properties that may have been previously suspected but not formally shown. We establish that language is: (1) self-similar, exhibiting…

Computation and Language · Computer Science 2024-05-24 Ibrahim Alabdulmohsin , Vinh Q. Tran , Mostafa Dehghani

When humans read a text, their eye movements are influenced by the structural complexity of the input sentences. This cognitive phenomenon holds across languages and recent studies indicate that multilingual language models utilize…

Computation and Language · Computer Science 2023-02-28 Charlotte Pouw , Nora Hollenstein , Lisa Beinborn

Modern work on the cross-linguistic computational modeling of morphological inflection has typically employed language-independent data splitting algorithms. In this paper, we supplement that approach with language-specific probes designed…

Computation and Language · Computer Science 2023-10-23 Jordan Kodner , Salam Khalifa , Sarah Payne

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…

Computational Complexity · Computer Science 2019-08-29 Hans Raj Tiwary

In recent years, the field of Natural Language Generation (NLG) has been boosted by the recent advances in deep learning technologies. Nonetheless, these new data-intensive methods introduce language-dependent disparities in NLG as the main…

In this article, we seek to answer the following question: could data duplication be useful in Natural Language Processing (NLP) for languages with limited computational resources? In this type of languages (or $\pi$-languages), corpora…

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

Formal Languages and Automata Theory · Computer Science 2018-02-22 Georg Zetzsche

The Chapter starts with introductory information about quantitative linguistics notions, like rank--frequency dependence, Zipf's law, frequency spectra, etc. Similarities in distributions of words in texts with level occupation in quantum…

Data Analysis, Statistics and Probability · Physics 2024-01-04 Andrij Rovenchak

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…

Computation and Language · Computer Science 2021-03-29 Hyunji Hayley Park , Katherine J. Zhang , Coleman Haley , Kenneth Steimel , Han Liu , Lane Schwartz

Recent research argues that exact recursive numeral systems optimize communicative efficiency by balancing a tradeoff between the size of the numeral lexicon and the average morphosyntactic complexity (roughly length in morphemes) of…

Though English sentences are typically inflexible vis-\`a-vis word order, constituents often show far more variability in ordering. One prominent theory presents the notion that constituent ordering is directly correlated with constituent…

Computation and Language · Computer Science 2025-02-18 Ada Defne Tur , Gaurav Kamath , Siva Reddy

We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when…

Formal Languages and Automata Theory · Computer Science 2010-08-11 Bianca Truthe

Increased popularity of different text representations has also brought many improvements in Natural Language Processing (NLP) tasks. Without need of supervised data, embeddings trained on large corpora provide us meaningful relations to be…

Computation and Language · Computer Science 2020-02-14 Gökhan Güler , A. Cüneyd Tantuğ

Contemporary deep learning models effectively handle languages with diverse morphology despite not being directly integrated into them. Morphology and word order are closely linked, with the latter incorporated into transformer-based models…

Computation and Language · Computer Science 2024-05-31 Poulami Ghosh , Shikhar Vashishth , Raj Dabre , Pushpak Bhattacharyya

Generalized contextuality is a hallmark of nonclassical theories like quantum mechanics. Yet, three fundamental computational problems concerning its decidability and complexity remain open. First, determining the complexity of deciding if…

Quantum Physics · Physics 2025-06-12 Theodoros Yianni , Farid Shahandeh

Recent studies suggest that very small language models (SLMs) can generate surprisingly coherent text when trained on simplified, child-directed corpora such as TinyStories. These findings have been interpreted as evidence that readability…

Computation and Language · Computer Science 2025-10-17 Ivan Lee , Taylor Berg-Kirkpatrick

Machine learning models allow us to compare languages by showing how hard a task in each language might be to learn and perform well on. Following this line of investigation, we explore what makes a language "hard to pronounce" by modelling…

Computation and Language · Computer Science 2022-02-11 Domenic Rosati