English
Related papers

Related papers: Very strict selectional restrictions

200 papers

GF(2)-grammars are a recently introduced grammar family with some unusual algebraic properties. They are closely connected to unambiguous grammars. By using the method of formal power series, we establish strong conditions that are…

Formal Languages and Automata Theory · Computer Science 2025-12-09 Vladislav Makarov

Targeted syntactic evaluation of subject-verb number agreement in English (TSE) evaluates language models' syntactic knowledge using hand-crafted minimal pairs of sentences that differ only in the main verb's conjugation. The method…

Computation and Language · Computer Science 2021-04-21 Benjamin Newman , Kai-Siang Ang , Julia Gong , John Hewitt

We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…

Combinatorics · Mathematics 2017-01-24 Oliver Kullmann , Xishun Zhao

We provide the syntax and semantics of the cat language, a domain specific language to describe consistency properties of parallel/distributed programs. The language is implemented in the herd7 too (http://diy.inria.fr/doc/herd.html)l.

Programming Languages · Computer Science 2016-08-31 Jade Alglave , Patrick Cousot , Luc Maranget

A way of extracting French verbal chunks, inflected and infinitive, is explored and tested on effective corpus. Declarative morphological and local grammar rules specifying chunks and some simple contextual structures are used, relying on…

Computation and Language · Computer Science 2007-05-23 Gabriel G. Bes , Lionel Lamadon , Francois Trouilleux

While syntactic inference restrictions don't play an important role for SAT, they are an essential reasoning technique for more expressive logics, such as first-order logic, or fragments thereof. In particular, they can result in short…

Logic in Computer Science · Computer Science 2020-01-01 Christoph Weidenbach

While the task of assessing the plausibility of events such as ''news is relevant'' has been addressed by a growing body of work, less attention has been paid to capturing changes in plausibility as triggered by event modification.…

Computation and Language · Computer Science 2025-07-30 Anna Golub , Beate Zywietz , Annerose Eichel

Idioms are unlike most phrases in two important ways. First, the words in an idiom have non-canonical meanings. Second, the non-canonical meanings of words in an idiom are contingent on the presence of other words in the idiom. Linguistic…

Computation and Language · Computer Science 2022-09-16 Michaela Socolof , Jackie Chi Kit Cheung , Michael Wagner , Timothy J. O'Donnell

The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language modeling. We argue that…

cmp-lg · Computer Science 2009-09-25 Yves Schabes , Stuart M. Shieber

Verbs occur in different syntactic environments, or frames. We investigate whether artificial neural networks encode grammatical distinctions necessary for inferring the idiosyncratic frame-selectional properties of verbs. We introduce five…

Computation and Language · Computer Science 2018-11-28 Katharina Kann , Alex Warstadt , Adina Williams , Samuel R. Bowman

In this work we analyze the performances of two of the most used word embeddings algorithms, skip-gram and continuous bag of words on Italian language. These algorithms have many hyper-parameter that have to be carefully tuned in order to…

Computation and Language · Computer Science 2017-12-01 Rocco Tripodi , Stefano Li Pira

The vector representation of words, known as word embeddings, has opened a new research approach in linguistic studies. These representations can capture different types of information about words. The grammatical gender of nouns is a…

Computation and Language · Computer Science 2020-11-04 Hartger Veeman , Ali Basirat

Grammatical forms are said to evolve via two main mechanisms. These are, respectively, the `descent' mechanism, where current forms can be seen to have descended (albeit with occasional modifications) from their roots in ancient languages,…

Statistical Mechanics · Physics 2023-02-20 Jean-Marc Luck , Anita Mehta

Why do some languages like Czech permit free word order, while others like English do not? We address this question by pretraining transformer language models on a spectrum of synthetic word-order variants of natural languages. We observe…

Computation and Language · Computer Science 2026-03-23 Jonas Mayer Martins , Jaap Jumelet , Viola Priesemann , Lisa Beinborn

In this paper we discuss the following issue: How do we decide whether a certain property of language is a competence property or a performance property? Our claim is that the answer to this question is not given a-priori. The answer…

cmp-lg · Computer Science 2008-02-03 Aravind K Joshi

This paper is concerned with minimal-length representatives of equivalence classes of words in F_2 under Aut F_2. We give a simple inequality characterizing words of minimal length in their equivalence class. We consider an operation that…

Group Theory · Mathematics 2013-04-02 Bobbe Cooper , Eric Rowland

Recent studies have shown that word embeddings exhibit gender bias inherited from the training corpora. However, most studies to date have focused on quantifying and mitigating such bias only in English. These analyses cannot be directly…

Computation and Language · Computer Science 2019-09-11 Pei Zhou , Weijia Shi , Jieyu Zhao , Kuan-Hao Huang , Muhao Chen , Ryan Cotterell , Kai-Wei Chang

Learning fine-grained distinctions between vocabulary items is a key challenge in learning a new language. For example, the noun "wall" has different lexical manifestations in Spanish -- "pared" refers to an indoor wall while "muro" refers…

Computation and Language · Computer Science 2021-09-14 Aditi Chaudhary , Kayo Yin , Antonios Anastasopoulos , Graham Neubig

We present a trainable model for identifying sentence boundaries in raw text. Given a corpus annotated with sentence boundaries, our model learns to classify each occurrence of ., ?, and ! as either a valid or invalid sentence boundary. The…

cmp-lg · Computer Science 2008-02-03 Jeffrey C. Reynar , Adwait Ratnaparkhi

Modal verbs, such as "can", "may", and "must", are commonly used in daily communication to convey the speaker's perspective related to the likelihood and/or mode of the proposition. They can differ greatly in meaning depending on how…

Computation and Language · Computer Science 2022-12-21 Risako Owan , Maria Gini , Dongyeop Kang
‹ Prev 1 4 5 6 7 8 10 Next ›