English
Related papers

Related papers: Comparing morphological complexity of Spanish, Oto…

200 papers

Morphologically-rich polysynthetic languages present a challenge for NLP systems due to data sparsity, and a common strategy to handle this issue is to apply subword segmentation. We investigate a wide variety of supervised and unsupervised…

Computation and Language · Computer Science 2022-03-18 Manuel Mager , Arturo Oncevay , Elisabeth Mager , Katharina Kann , Ngoc Thang Vu

Exploiting the fact that natural languages are complex systems, the present exploratory article proposes a direct method based on frequency distributions that may be useful when making a decision on the status of problematic phonemes, an…

Computation and Language · Computer Science 2018-08-23 Manuel Ortega-Rodríguez , Hugo Solís-Sánchez , Ricardo Gamboa-Alfaro

In the context of ontology-mediated querying with description logics (DLs), we study the data complexity of queries in which selected predicates can be closed (OMQCs). We provide a non-uniform analysis, aiming at a classification of the…

Logic in Computer Science · Computer Science 2023-06-22 Carsten Lutz , Inanc Seylan , Frank Wolter

The aim of this article is to introduce two Context-Free Grammars (CFG) for Nawatl Corpora expansion. Nawatl is an Amerindian language (it is a National Language of Mexico) of the $\pi$-language type, i.e. a language with few digital…

As NLP tools become ubiquitous in today's technological landscape, they are increasingly applied to languages with a variety of typological structures. However, NLP research does not focus primarily on typological differences in its…

Computation and Language · Computer Science 2020-05-04 Sophie Groenwold , Samhita Honnavalli , Lily Ou , Aesha Parekh , Sharon Levy , Diba Mirza , William Yang Wang

We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $\Theta(n^{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.

Combinatorics · Mathematics 2015-02-23 Rostislav Devyatov

Large language models (LLMs) are capable of writing grammatical text that follows instructions, answers questions, and solves problems. As they have advanced, it has become difficult to distinguish their output from human-written text.…

Computation and Language · Computer Science 2025-08-25 Alex Reinhart , Ben Markey , Michael Laudenbach , Kachatad Pantusen , Ronald Yurko , Gordon Weinberg , David West Brown

All living languages change over time. The causes for this are many, one being the emergence and borrowing of new linguistic elements. Competition between the new elements and older ones with a similar semantic or grammatical function may…

Computation and Language · Computer Science 2020-06-17 Andres Karjus , Richard A. Blythe , Simon Kirby , Kenny Smith

Are large language models (LLMs) sensitive to the distinction between humanly possible and impossible languages? This question was recently used in a broader debate on whether LLMs and humans share the same innate learning biases. Previous…

Computation and Language · Computer Science 2026-04-01 Imry Ziv , Nur Lan , Emmanuel Chemla

Subword tokenization algorithms used by Large Language Models are significantly more efficient and can independently build the necessary vocabulary of words and subwords without human intervention. However, those subwords do not always…

Computation and Language · Computer Science 2024-10-04 Óscar García-Sierra , Ana Fernández-Pampillón Cesteros , Miguel Ortega-Martín

Investigating whether pre-trained language models (LMs) can function as knowledge bases (KBs) has raised wide research interests recently. However, existing works focus on simple, triple-based, relational KBs, but omit more sophisticated,…

Computation and Language · Computer Science 2023-05-09 Yuan He , Jiaoyan Chen , Ernesto Jiménez-Ruiz , Hang Dong , Ian Horrocks

We analyze the rank-frequency distributions of words in selected English and Polish texts. We compare scaling properties of these distributions in both languages. We also study a few small corpora of Polish literary texts and find that for…

Computation and Language · Computer Science 2015-11-11 Stanislaw Drozdz , Jaroslaw Kwapien , Adam Orczyk

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. We investigate various comet-like types of languages and compare such language…

Formal Languages and Automata Theory · Computer Science 2024-09-12 Marvin Ködding , Bianca Truthe

We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode…

Dynamical Systems · Mathematics 2018-10-16 Friedrich Martin Schneider , Daniel Borchmann

This paper reports on results on the entropy of the Spanish language. They are based on an analysis of natural language for n-word symbols (n = 1 to 18), trigrams, digrams, and characters. The results obtained in this work are based on the…

Computation and Language · Computer Science 2013-01-15 Fabio G. Guerrero

Translation into morphologically-rich languages challenges neural machine translation (NMT) models with extremely sparse vocabularies where atomic treatment of surface forms is unrealistic. This problem is typically addressed by either…

Computation and Language · Computer Science 2020-02-28 Duygu Ataman , Wilker Aziz , Alexandra Birch

Lexical ambiguity -- where a single wordform takes on distinct, context-dependent meanings -- serves as a useful tool to compare across different language models' (LMs') ability to form distinct, contextualized representations of the same…

Computation and Language · Computer Science 2025-03-14 Pamela D. Rivière , Anne L. Beatty-Martínez , Sean Trott

As is the case of many signals produced by complex systems, language presents a statistical structure that is balanced between order and disorder. Here we review and extend recent results from quantitative characterisations of the degree of…

Computation and Language · Computer Science 2015-03-05 Marcelo A Montemurro , Damián H Zanette

Language models perform differently across languages. It has been previously suggested that morphological typology may explain some of this variability (Cotterell et al., 2018). We replicate previous analyses and find additional new…

Computation and Language · Computer Science 2024-11-22 Catherine Arnett , Benjamin K. Bergen

This thesis investigates how the sub-structure of words can be accounted for in probabilistic models of language. Such models play an important role in natural language processing tasks such as translation or speech recognition, but often…

Computation and Language · Computer Science 2015-08-19 Jan A. Botha