English
Related papers

Related papers: Very strict selectional restrictions

200 papers

Lambek Grammars (LG) are a computational modelling of natural language, based on non-commutative compositional types. It has been widely studied, especially for languages where the syntax plays a major role (like English). The goal of this…

Computation and Language · Computer Science 2020-02-04 Valentin D. Richard

We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected $k \times k$ matrix. Only one entry of the…

Formal Languages and Automata Theory · Computer Science 2016-09-09 Özlem Salehi , Abuzer Yakaryılmaz , A. C. Cem Say

We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean…

Formal Languages and Automata Theory · Computer Science 2015-03-19 Franz Jahn , Manfred Kufleitner , Alexander Lauser

Grammar refers to the system of rules that governs the structural organization and the semantic relations among linguistic units such as sentences, phrases, and words within a given language. In natural language processing, there remains a…

Computation and Language · Computer Science 2026-02-24 Lujun Li , Yewei Song , Lama Sleem , Yiqun Wang , Yangjie Xu , Cedric Lothritz , Niccolo Gentile , Radu State , Tegawende F. Bissyande , Jacques Klein

We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…

Combinatorics · Mathematics 2016-01-05 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Neural language models learn, to varying degrees of accuracy, the grammatical properties of natural languages. In this work, we investigate whether there are systematic sources of variation in the language models' accuracy. Focusing on…

Computation and Language · Computer Science 2020-10-28 Charles Yu , Ryan Sie , Nico Tedeschi , Leon Bergen

A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being well-understood, it is difficult to devise decision…

Formal Languages and Automata Theory · Computer Science 2018-02-20 Wojciech Czerwiński , Piotr Hofman , Georg Zetzsche

A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a natural partial ordering on the setting of parameters.…

cmp-lg · Computer Science 2008-02-03 Ted Briscoe

Recent work has shown evidence that the knowledge acquired by multilingual BERT (mBERT) has two components: a language-specific and a language-neutral one. This paper analyses the relationship between them, in the context of fine-tuning on…

Computation and Language · Computer Science 2021-12-28 Marc Tanti , Lonneke van der Plas , Claudia Borg , Albert Gatt

While language is a complex adaptive system, most work on syntactic variation observes a few individual constructions in isolation from the rest of the grammar. This means that the grammar, a network which connects thousands of structures…

Computation and Language · Computer Science 2023-09-22 Jonathan Dunn

In order to capture rich language phenomena, neural machine translation models have to use a large vocabulary size, which requires high computing time and large memory usage. In this paper, we alleviate this issue by introducing a…

Computation and Language · Computer Science 2016-08-02 Haitao Mi , Zhiguo Wang , Abe Ittycheriah

This paper presents a number of experiments to model changes in a historical Portuguese corpus composed of literary texts for the purpose of temporal text classification. Algorithms were trained to classify texts with respect to their…

Computation and Language · Computer Science 2016-10-04 Marcos Zampieri , Shervin Malmasi , Mark Dras

We revisit Levin's theory about the correspondence of verb meaning and syntax and infer semantic classes from a large syntactic classification of more than 600 German verbs taking clausal and non-finite arguments. Grasping the meaning…

Computation and Language · Computer Science 2016-06-24 Judith Eckle-Kohler

The representation of sentences is a very important task. It can be used as a way to exchange data inter-applications. One main characteristic, that a notation must have, is a minimal size and a representative form. This can reduce the…

Computation and Language · Computer Science 2018-01-12 Abdelkrime Aries , Djamel Eddine Zegour , Walid Khaled Hidouci

We study the role of the second language in bilingual word embeddings in monolingual semantic evaluation tasks. We find strongly and weakly positive correlations between down-stream task performance and second language similarity to the…

Computation and Language · Computer Science 2016-10-12 Steffen Eger , Armin Hoenen , Alexander Mehler

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Richard Mandel , Corto Mascle , Georg Zetzsche

We remark that forcing on fiber bundles of structures of first order languages is not a compatible semantics with the pullback (of fiber bundles) and we describe a semantics which behaves well with respect to it. This new semantics uses…

Logic · Mathematics 2022-08-24 Leonardo A. Cano G , Pedro H. Zambrano

To understand historical texts, we must be aware that language -- including the emotional connotation attached to words -- changes over time. In this paper, we aim at estimating the emotion which is associated with a given word in former…

Computation and Language · Computer Science 2019-04-09 Johannes Hellrich , Sven Buechel , Udo Hahn

We give analogues of the Auslander correspondence for two classes of triangulated categories satisfying certain finiteness conditions. The first class is triangulated categories with additive generators and we consider their endomorphism…

Representation Theory · Mathematics 2020-09-23 Norihiro Hanihara

We introduce quantitative metrics for child language acquisition to evaluate language models. Our focus is on the formal syntactic and functional discourse properties of determiners in English, which young children acquire early and…

Computation and Language · Computer Science 2026-05-28 Héctor Javier Vázquez Martínez , Charles Yang