English
Related papers

Related papers: Local generation of languages: the monotonic binar…

200 papers

We define the concept of a monotonic theory and show how to build efficient SMT (SAT Modulo Theory) solvers, including effective theory propagation and clause learning, for such theories. We present examples showing that monotonic theories…

Logic in Computer Science · Computer Science 2014-06-03 Sam Bayless , Noah Bayless , Holger H. Hoos , Alan J. Hu

Techniques are developed for creating new and general language families of only semilinear languages, and for showing families only contain semilinear languages. It is shown that for language families L that are semilinear full trios, the…

Formal Languages and Automata Theory · Computer Science 2022-12-05 Oscar H. Ibarra , Ian McQuillan

How do humans learn language, and can the first language be learned at all? These fundamental questions are still hotly debated. In contemporary linguistics, there are two major schools of thought that give completely opposite answers.…

Computation and Language · Computer Science 2023-02-16 Kishore Surendra , Achim Schilling , Paul Stoewer , Andreas Maier , Patrick Krauss

In comparison to the interpretation of classification models, the explanation of sequence generation models is also an important problem, however it has seen little attention. In this work, we study model-agnostic explanations of a…

Computation and Language · Computer Science 2022-02-08 Yi-Lin Tuan , Connor Pryor , Wenhu Chen , Lise Getoor , William Yang Wang

Recent works on language identification and generation have established tight statistical rates at which these tasks can be achieved. These works typically operate under a strong realizability assumption: that the input data is drawn from…

Machine Learning · Computer Science 2026-04-23 Mikael Møller Høgsgaard , Chirag Pabbaraju

Children learn their native language by exposure to their linguistic and communicative environment, but apparently without requiring that their mistakes are corrected. Such learning from positive evidence has been viewed as raising logical…

Computation and Language · Computer Science 2013-01-21 Anne S. Hsu , Nick Chater , Paul M. B. Vitányi

The problem of implementing a class of functions with particular conditions by using monotonic multilayer functions is considered. A genetic algorithm is used to create monotonic functions of a certain class, and these are implemented with…

Neural and Evolutionary Computing · Computer Science 2012-11-06 Yukihiro Kamada , Kiyonori Miyasaki

Recent advances in deep neural language models combined with the capacity of large scale datasets have accelerated the development of natural language generation systems that produce fluent and coherent texts (to various degrees of success)…

Computation and Language · Computer Science 2025-04-15 Cristina Garbacea , Qiaozhu Mei

This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Mikołaj Bojańczyk , Luc Segoufin , Howard Straubing

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba

A quantitative method is suggested, where meanings of words, and grammatic rules about these, of a vocabulary are represented by real numbers. People meet randomly, and average their vocabularies if they are equal; otherwise they either…

Physics and Society · Physics 2009-11-13 Caglar Tuncay

Natural language generation (NLG) is a critical component in spoken dialogue systems. Classic NLG can be divided into two phases: (1) sentence planning: deciding on the overall sentence structure, (2) surface realization: determining…

Computation and Language · Computer Science 2018-08-10 Shang-Yu Su , Kai-Ling Lo , Yi-Ting Yeh , Yun-Nung Chen

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. In the past, two independent hierarchies have been obtained for external and internal…

Computational Complexity · Computer Science 2023-09-19 Bianca Truthe

We consider languages defined by signed grammars which are similar to context-free grammars except productions with signs associated to them are allowed. As a consequence, the words generated also have signs. We use the structure of the…

Formal Languages and Automata Theory · Computer Science 2023-09-19 Ömer Eğecioğlu , Benedek Nagy

This work aims to employ natural language generation (NLG) to rapidly generate items for English language learning applications: this requires both language models capable of generating fluent, high-quality English, and to control the…

Computation and Language · Computer Science 2022-11-30 Kevin Stowe , Debanjan Ghosh , Mengxuan Zhao

In this article, we investigate the possibility of generating all the configurations of a subshift in a local way. We propose two definitions of local generation, explore their properties and develop techniques to determine whether a…

Dynamical Systems · Mathematics 2025-12-03 Tom Favereau , Mathieu Hoyrup

The iterated learning model is an agent-based model of language evolution notable for demonstrating the emergence of compositional language. In its original form, it modelled language evolution along a single chain of teacher-pupil…

Multiagent Systems · Computer Science 2023-05-23 George Sains , Conor Houghton , Seth Bullock

Despite the success of language models using neural networks, it remains unclear to what extent neural models have the generalization ability to perform inferences. In this paper, we introduce a method for evaluating whether neural models…

Computation and Language · Computer Science 2020-05-05 Hitomi Yanaka , Koji Mineshima , Daisuke Bekki , Kentaro Inui

Developing successful sign language recognition, generation, and translation systems requires expertise in a wide range of fields, including computer vision, computer graphics, natural language processing, human-computer interaction,…

In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$ for any fixed $j \geq 1$. We will prove that this generation is exhaustive, that is,…

Discrete Mathematics · Computer Science 2012-10-30 Stefano Bilotta , Elisabetta Grazzini , Elisa Pergola , Renzo Pinzani