English
Related papers

Related papers: Two-parameter Model of Word Length "Language - Gen…

200 papers

The process of meaning composition, wherein smaller units like morphemes or words combine to form the meaning of phrases and sentences, is essential for human sentence comprehension. Despite extensive neurolinguistic research into the brain…

Computation and Language · Computer Science 2024-07-11 Changjiang Gao , Jixing Li , Jiajun Chen , Shujian Huang

Paraphrasing is the task of expressing an essential idea or meaning in different words. But how different should the words be in order to be considered an acceptable paraphrase? And can we exclusively use automated metrics to evaluate the…

Computation and Language · Computer Science 2023-07-28 Anna Moskvina , Bhushan Kotnis , Chris Catacata , Michael Janz , Nasrin Saef

Words can be represented by composing the representations of subword units such as word segments, characters, and/or character n-grams. While such representations are effective and may capture the morphological regularities of words, they…

Computation and Language · Computer Science 2017-04-28 Clara Vania , Adam Lopez

Recently, large language models such as GPT-2 have shown themselves to be extremely adept at text generation and have also been able to achieve high-quality results in many downstream NLP tasks such as text classification, sentiment…

Computation and Language · Computer Science 2019-11-22 Sam Witteveen , Martin Andrews

Over the years, many researchers have seemingly made the same observation: Brain and language model activations exhibit some structural similarities, enabling linear partial mappings between features extracted from neural recordings and…

Computation and Language · Computer Science 2023-06-09 Antonia Karamolegkou , Mostafa Abdou , Anders Søgaard

What can large language models learn? By definition, language models (LM) are distributions over strings. Therefore, an intuitive way of addressing the above question is to formalize it as a matter of learnability of classes of…

Computation and Language · Computer Science 2025-01-14 Nadav Borenstein , Anej Svete , Robin Chan , Josef Valvoda , Franz Nowak , Isabelle Augenstein , Eleanor Chodroff , Ryan Cotterell

LLMs have been widely used in planning, either as planners to generate action sequences end-to-end, or as formalizers to represent the planning domain and problem in a formal language that can derive plans deterministically. However, both…

Computation and Language · Computer Science 2026-04-17 Cassie Huang , Stuti Mohan , Ziyi Yang , Stefanie Tellex , Li Zhang

Scaling existing applications and solutions to multiple human languages has traditionally proven to be difficult, mainly due to the language-dependent nature of preprocessing and feature engineering techniques employed in traditional…

Computation and Language · Computer Science 2020-01-01 Xiaotong Liu , Yingbei Tong , Anbang Xu , Rama Akkiraju

The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…

Combinatorics · Mathematics 2025-12-12 Anna E. Frid

Large language models (LLMs) take sequences of subwords as input, requiring them to effective compose subword representations into meaningful word-level representations. In this paper, we present a comprehensive set of experiments to probe…

Computation and Language · Computer Science 2025-08-26 Qiwei Peng , Yekun Chai , Anders Søgaard

Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we…

Computational Complexity · Computer Science 2009-04-14 Terry Anderson , John Loftus , Narad Rampersad , Nicolae Santean , Jeffrey Shallit

The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of…

Combinatorics · Mathematics 2014-09-16 Hannah Vogel

Readability assessment aims to automatically classify text by the level appropriate for learning readers. Traditional approaches to this task utilize a variety of linguistically motivated features paired with simple machine learning models.…

Computation and Language · Computer Science 2020-08-04 Tovly Deutsch , Masoud Jasbi , Stuart Shieber

Sentence simplification reduces semantic complexity to benefit people with language impairments. Previous simplification studies on the sentence level and word level have achieved promising results but also meet great challenges. For…

Computation and Language · Computer Science 2017-04-10 Yaoyuan Zhang , Zhenxu Ye , Yansong Feng , Dongyan Zhao , Rui Yan

We propose an alternate approach to quantifying how well language models learn natural language: we ask how well they match the statistical tendencies of natural language. To answer this question, we analyze whether text generated from…

Computation and Language · Computer Science 2021-08-31 Clara Meister , Ryan Cotterell

A binary word is symmetric if it is a palindrome or an antipalindrome. We define a new measure of asymmetry of a binary word equal to the minimal number of letters of the word whose deleting from the word yields a symmetric word and obtain…

Combinatorics · Mathematics 2010-04-09 Alex Ravsky

The book is devoted to two research areas: (1) Designing programming languages along with their denotational models. A denotational model of a language consists of two many-sorted algebras - an algebra of syntax and an algebra of…

Programming Languages · Computer Science 2019-05-07 Blikle Andrzej

We discuss inequalities holding between the vocabulary size, i.e., the number of distinct nonterminal symbols in a grammar-based compression for a string, and the excess length of the respective universal code, i.e., the code-based analog…

Information Theory · Computer Science 2020-03-11 Lukasz Debowski

The representations in large language models contain multiple types of gender information. We focus on two types of such signals in English texts: factual gender information, which is a grammatical or semantic property, and gender bias,…

Computation and Language · Computer Science 2022-06-23 Tomasz Limisiewicz , David Mareček

We define two words in a language to be connected if they express similar concepts. The network of connections among the many thousands of words that make up a language is important not only for the study of the structure and evolution of…

Disordered Systems and Neural Networks · Physics 2009-11-07 Adilson E. Motter , Alessandro P. S. de Moura , Ying-Cheng Lai , Partha Dasgupta