English
Related papers

Related papers: A type-theoretical approach to Universal Grammar

200 papers

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

The orthodox interpretation of quantum theory treats the subject and the object on an equal footing. It has been suggested that the cyclical-time process, which resolves self-reference in consciousness, interconnects the observed universe…

General Physics · Physics 2019-01-08 Daegene Song

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

We aim to provide an explanation for how the human brain might connect words for sentence formation. A novel approach to modeling syntactic representation is introduced, potentially showing the existence of universal syntactic structures…

Computation and Language · Computer Science 2024-02-06 Min K. Kim , Hafu Takero , Sara Fedovik

What does it mean to know language? Since the Chomskian revolution, one popular answer to this question has been: to possess a generative grammar that exclusively licenses certain syntactic structures. Decades later, not even an…

Computation and Language · Computer Science 2023-03-15 Shimon Edelman

A unified theory of language combines a Bayesian cognitive linguistic model of language processing, with the proposal that language evolved by sexual selection for the display of intelligence. The theory accounts for the major facts of…

Neurons and Cognition · Quantitative Biology 2025-08-29 Robert Worden

The world's languages exhibit certain so-called typological or implicational universals; for example, Subject-Object-Verb (SOV) languages typically use postpositions. Explaining the source of such biases is a key goal of linguistics. We…

Computation and Language · Computer Science 2024-06-11 Tatsuki Kuribayashi , Ryo Ueda , Ryo Yoshida , Yohei Oseki , Ted Briscoe , Timothy Baldwin

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

This paper presents a model for linguistic description based on group theory. A grammar in this model, or "G-grammar", is a collection of lexical expressions which are products of logical forms, phonological forms, and their inverses.…

cmp-lg · Computer Science 2007-05-23 Marc Dymetman

The study of linguistic typology is rooted in the implications we find between linguistic features, such as the fact that languages with object-verb word ordering tend to have post-positions. Uncovering such implications typically amounts…

Computation and Language · Computer Science 2019-06-19 Johannes Bjerva , Yova Kementchedjhieva , Ryan Cotterell , Isabelle Augenstein

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory. From the prespective of grammar design, type-logical grammars develop the syntactic and semantic aspects of linguistic phenomena…

Computation and Language · Computer Science 2016-08-29 Richard Moot

Linguistic typology studies the range of structures present in human language. The main goal of the field is to discover which sets of possible phenomena are universal, and which are merely frequent. For example, all languages have vowels,…

Computation and Language · Computer Science 2017-05-05 Ryan Cotterell , Jason Eisner

Stabler proposes an implementation of the Chomskyan Minimalist Program, Chomsky 95 with Minimalist Grammars - MG, Stabler 97. This framework inherits a long linguistic tradition. But the semantic calculus is more easily added if one uses…

Computation and Language · Computer Science 2011-08-26 Maxime Amblard

NLP is deeply intertwined with the formal study of language, both conceptually and historically. Arguably, this connection goes all the way back to Chomsky's Syntactic Structures in 1957. It also still holds true today, with a strand of…

Computation and Language · Computer Science 2021-07-28 William Merrill

In this article, we present a fresh perspective on language, combining ideas from various sources, but mixed in a new synthesis. As in the minimalist program, the question is whether we can formulate an elegant formalism, a universal…

Computation and Language · Computer Science 2023-03-10 Loe Feijs

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a…

Computation and Language · Computer Science 2007-05-23 Henning Christiansen

Grammars are used to describe sentences structure, thanks to some sets of rules, which depends on the grammar type. A classification of grammars has been made by Noam Chomsky, which led to four well-known types. Yet, there are other types…

Cryptography and Security · Computer Science 2010-09-22 Geoffroy Gueguen

Types are an important part of any modern programming language, but we often forget that the concept of type we understand nowadays is not the same it was perceived in the sixties. Moreover, we conflate the concept of "type" in programming…

Programming Languages · Computer Science 2017-03-30 Simone Martini

In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…

Logic in Computer Science · Computer Science 2014-05-27 Richard Moot
‹ Prev 1 2 3 10 Next ›