English
Related papers

Related papers: Indexed Languages and Unification Grammars

200 papers

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

Formal Languages and Automata Theory · Computer Science 2019-01-09 Dietrich Kuske , Georg Zetzsche

We consider the class of languages defined in the 2-variable fragment of the first-order logic of the linear order. Many interesting characterizations of this class are known, as well as the fact that restricting the number of quantifier…

Logic in Computer Science · Computer Science 2018-01-03 Manfred Kufleitner , Pascal Weil

Constraint logic grammars provide a powerful formalism for expressing complex logical descriptions of natural language phenomena in exact terms. Describing some of these phenomena may, however, require some form of graded distinctions which…

cmp-lg · Computer Science 2008-02-03 Stefan Riezler

We extend the Chomsky/Sch\"utzenberger method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.

Combinatorics · Mathematics 2014-01-08 Jared Adam , Eric Freden , Marni Mishna

We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…

Computation and Language · Computer Science 2011-02-28 Victor Gluzberg

Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in…

Combinatorics · Mathematics 2018-10-19 Sarah J. Berkemer , Christian Höner zu Siederdissen , Peter F. Stadler

GF(2)-grammars are a somewhat recently introduced grammar family that have some unusual algebraic properties and are closely connected to unambiguous grammars. In "Bounded languages described by GF(2)-grammars", Makarov proved a necessary…

Formal Languages and Automata Theory · Computer Science 2023-12-12 Vladislav Makarov , Marat Movsin

Random Indexing is a simple implementation of Random Projections with a wide range of applications. It can solve a variety of problems with good accuracy without introducing much complexity. Here we use it for identifying the language of…

Computation and Language · Computer Science 2015-03-02 Aditya Joshi , Johan Halseth , Pentti Kanerva

We introduce a new framework linking group theory and formal language theory which generalizes a number of ways these topics have been linked in the past. For a language class C in the Chomsky hierarchy, we say a group is epiC if it admits…

Group Theory · Mathematics 2025-03-04 Raad Al Kohli , Collin Bleak , Luna Elliott

This article aims to characterize Generative linguistics (GL) contribution to artificial intelligence (AI), alluding to the debate among linguists and AI scientists on whether linguistics belongs to humanities or science. In this article, I…

Computation and Language · Computer Science 2024-11-05 Mohammed Q. Shormani

In mid-20th century, the linguist Noam Chomsky established generative linguistics, and made significant contributions to linguistics, computer science, and cognitive science by developing the computational and philosophical foundations for…

Computation and Language · Computer Science 2025-05-27 Eva Portelance , Masoud Jasbi

We present a critical assessment of Piantadosi's (2023) claim that "Modern language models refute Chomsky's approach to language," focusing on four main points. First, despite the impressive performance and utility of large language models…

Computation and Language · Computer Science 2023-08-08 Jordan Kodner , Sarah Payne , Jeffrey Heinz

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 characterize the infinite words determined by indexed languages. An infinite language $L$ determines an infinite word $\alpha$ if every string in $L$ is a prefix of $\alpha$. If $L$ is regular or context-free, it is known that $\alpha$…

Formal Languages and Automata Theory · Computer Science 2014-06-18 Tim Smith

What is here called controlled natural language (CNL) has traditionally been given many different names. Especially during the last four decades, a wide variety of such languages have been designed. They are applied to improve communication…

Computation and Language · Computer Science 2015-07-08 Tobias Kuhn

$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Mikołaj Bojańczyk , Bartek Klin

Selection through iterated learning explains no more than other non-functional accounts, such as universal grammar, why language is so well-designed for communicative efficiency. It does not predict several distinctive features of language…

Computation and Language · Computer Science 2011-08-23 Jean-Louis Dessalles

Universal Grammar (UG) theory has been one of the most important research topics in linguistics since introduced five decades ago. UG specifies the restricted set of languages learnable by human brain, and thus, many researchers believe in…

Computation and Language · Computer Science 2014-12-09 M. Yahia Kaadan , Asaad Kaadan

Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical…

Logic · Mathematics 2024-08-23 Boris Čulina

Linear Logic refines Intuitionnistic Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various frameworks. The most famous are indexed linear logics which…

Logic in Computer Science · Computer Science 2026-01-14 Flavien Breuvart , Marie Kerjean , Simon Mirwasser