English
Related papers

Related papers: On the Evolution of Word Order

200 papers

This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the…

Logic in Computer Science · Computer Science 2017-01-11 Irini-Eleftheria Mens , Oded Maler

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

The principle of compositionality, which enables natural language to represent complex concepts via a structured combination of simpler ones, allows us to convey an open-ended set of messages using a limited vocabulary. If compositionality…

Computation and Language · Computer Science 2020-02-18 Yi Ren , Shangmin Guo , Matthieu Labeau , Shay B. Cohen , Simon Kirby

Studies of discrete languages emerging when neural agents communicate to solve a joint task often look for evidence of compositional structure. This stems for the expectation that such a structure would allow languages to be acquired faster…

Computation and Language · Computer Science 2020-04-28 Eugene Kharitonov , Marco Baroni

Nobody knows how language works, but many theories abound. Transformers are a class of neural networks that process language automatically with more success than alternatives, both those based on neural computations and those that rely on…

Computation and Language · Computer Science 2024-08-08 Felix Hill

Language change is a cultural evolutionary process in which variants of linguistic variables change in frequency through processes analogous to mutation, selection and genetic drift. In this work, we apply a recently-introduced method to…

Computation and Language · Computer Science 2023-08-22 Juan Guerrero Montero , Andres Karjus , Kenny Smith , Richard A. Blythe

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an…

Data Structures and Algorithms · Computer Science 2014-06-23 Péter Burcsi , Gabriele Fici , Zsuzsanna Lipták , Frank Ruskey , Joe Sawada

Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can…

Programming Languages · Computer Science 2007-05-23 Roberto Bagnara , Roberta Gori , Patricia M. Hill , Enea Zaffanella

We examine a naming game with two agents trying to establish a common vocabulary for n objects. Such efforts lead to the emergence of language that allows for an efficient communication and exhibits some degree of homonymy and synonymy.…

Computation and Language · Computer Science 2015-05-13 Adam Lipowski , Dorota Lipowska

Pro-drop is commonly seen in many languages, but its discourse motivations have not been well characterized. Inspired by the topic chain theory in Chinese, this study shows how character-verb usage continuity distinguishes dropped pronouns…

Computation and Language · Computer Science 2022-09-19 Shulin Zhang , Jixing Li , John Hale

Topic evolution modeling has been researched for a long time and has gained considerable interest. A state-of-the-art method has been recently using word modeling algorithms in combination with community detection mechanisms to achieve…

Computation and Language · Computer Science 2019-12-17 Patrick Kiss , Elaheh Momeni

Dictionaries are inherently circular in nature. A given word is linked to a set of alternative words (the definition) which in turn point to further descendants. Iterating through definitions in this way, one typically finds that…

Computation and Language · Computer Science 2011-03-14 David Levary , Jean-Pierre Eckmann , Elisha Moses , Tsvi Tlusty

The evolution in coding DNA sequences brings new flexibility and freedom to the codon words, even as the underlying nucleotides get significantly ordered. These curious contra-rules of gene organisation are observed from the distribution of…

Biological Physics · Physics 2007-05-23 Sujay Chattopadhyay , William A. Kanner , Jayprokas Chakrabarti

Despite large language models' (LLMs) recent advancements, their bias and hallucination issues persist, and their ability to offer consistent preferential rankings remains underexplored. This study investigates the capacity of LLMs to…

Computation and Language · Computer Science 2024-10-14 Xiutian Zhao , Ke Wang , Wei Peng

A standard form of analysis for linguistic typology is the universal implication. These implications state facts about the range of extant languages, such as ``if objects come after verbs, then adjectives come after nouns.'' Such…

Computation and Language · Computer Science 2009-07-07 Hal Daumé , Lyle Campbell

Higher-order grammars are extensions of regular and context-free grammars, where non-terminals may take parameters. They have been extensively studied in 1980's, and restudied recently in the context of model checking and program…

Formal Languages and Automata Theory · Computer Science 2016-05-23 Kazuyuki Asada , Naoki Kobayashi

Prediction in language has traditionally been studied using simple designs in which neural responses to expected and unexpected words are compared in a categorical fashion. However, these designs have been contested as being `prediction…

Neurons and Cognition · Quantitative Biology 2019-09-11 Micha Heilbron , Benedikt Ehinger , Peter Hagoort , Floris P. de Lange

We study decision problems of the form: given a regular or linear context-free language $L$, is there a word of a given fixed form in $L$, where given fixed forms are based on word operations copy, marked copy, shuffle and their…

Formal Languages and Automata Theory · Computer Science 2026-04-08 Vesa Halava , Tero Harju , Dirk Nowotka , Esa Sahla

Lexical ambiguity is widespread in language, allowing for the reuse of economical word forms and therefore making language more efficient. If ambiguous words cannot be disambiguated from context, however, this gain in efficiency might make…

Computation and Language · Computer Science 2024-05-29 Tiago Pimentel , Rowan Hall Maudslay , Damián Blasi , Ryan Cotterell

Determining the relative importance of the elements in a sentence is a key factor for effortless natural language understanding. For human language processing, we can approximate patterns of relative importance by measuring reading…

Computation and Language · Computer Science 2021-06-08 Nora Hollenstein , Lisa Beinborn