English
Related papers

Related papers: Very strict selectional restrictions

200 papers

In this paper we investigated two different methods to parse relative and noun complement clauses in English and resorted to distinct tags for their corresponding that as a relative pronoun and as a complementizer. We used an algorithm to…

Computation and Language · Computer Science 2022-12-07 Zineddine Tighidet , Nicolas Ballier

Although much effort has recently been devoted to training high-quality sentence embeddings, we still have a poor understanding of what they are capturing. "Downstream" tasks, often based on sentence classification, are commonly used to…

Computation and Language · Computer Science 2018-07-10 Alexis Conneau , German Kruszewski , Guillaume Lample , Loïc Barrault , Marco Baroni

Cross-lingual model transfer is a compelling and popular method for predicting annotations in a low-resource language, whereby parallel corpora provide a bridge to a high-resource language and its associated annotated corpora. However,…

Computation and Language · Computer Science 2017-05-02 Meng Fang , Trevor Cohn

We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces…

Formal Languages and Automata Theory · Computer Science 2014-05-13 Ryoma Sin'ya

Compounding is a highly productive word-formation process in some languages that is often problematic for natural language processing applications. In this paper, we investigate whether distributional semantics in the form of word…

Computation and Language · Computer Science 2015-09-16 Joachim Daiber , Lautaro Quiroz , Roger Wechsler , Stella Frank

While most approaches to automatically recognizing entailment relations have used classifiers employing hand engineered features derived from complex natural language processing pipelines, in practice their performance has been only…

Computation and Language · Computer Science 2016-03-02 Tim Rocktäschel , Edward Grefenstette , Karl Moritz Hermann , Tomáš Kočiský , Phil Blunsom

Manner and result verbs encode different aspects of event structure and have been discussed in developmental work as a potentially informative distinction for studying early verb learning. However, this distinction remains difficult to…

This paper presents the shared task on Multilingual Idiomaticity Detection and Sentence Embedding, which consists of two subtasks: (a) a binary classification task aimed at identifying whether a sentence contains an idiomatic expression,…

Computation and Language · Computer Science 2022-05-31 Harish Tayyar Madabushi , Edward Gow-Smith , Marcos Garcia , Carolina Scarton , Marco Idiart , Aline Villavicencio

This paper leverages past sentence processing studies to investigate whether monolingual and multilingual LLMs show human-like preferences when presented with examples of relative clause attachment ambiguities in Italian and English.…

Computation and Language · Computer Science 2025-04-15 Michael Kamerath , Aniello De Santo

Vague temporal adverbials, such as recently, just, and a long time ago, describe the temporal distance between a past event and the utterance time but leave the exact duration underspecified. In this paper, we introduce a factorized model…

Computation and Language · Computer Science 2025-08-26 Svenja Kenneweg , Jörg Deigmöller , Julian Eggert , Philipp Cimiano

Artificial neural networks can generalize productively to novel contexts. Can they also learn exceptions to those productive rules? We explore this question using the case of restrictions on English passivization (e.g., the fact that "The…

Computation and Language · Computer Science 2023-06-12 Cara Su-Yi Leong , Tal Linzen

We introduce and investigate (dual) relative split objects with respect to a fully invariant short exact sequence in abelian categories. We compare them with (dual) relative Rickart objects, and we study their behaviour with respect to…

Category Theory · Mathematics 2018-03-15 Septimiu Crivei , Derya Keskin Tütüncü , Rachid Tribak

We develop a denotational model for probabilistic and concurrent imperative programs, a class of programs with standard control flow via conditionals and while-loops, as well as probabilistic actions and parallel composition. Whereas…

Programming Languages · Computer Science 2025-06-10 Noam Zilberstein , Daniele Gorla , Alexandra Silva

We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as…

Artificial Intelligence · Computer Science 2009-06-30 George Katsirelos , Sebastian Maneth , Nina Narodytska , Toby Walsh

In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, we extend our…

Formal Languages and Automata Theory · Computer Science 2020-01-13 Dan Shiebler , Alexis Toumi , Mehrnoosh Sadrzadeh

We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidable learning. The semantics of such languages can be defined…

Logic in Computer Science · Computer Science 2023-03-22 Paul Krogmeier , P. Madhusudan

The German plural system has become a focal point for conflicting theories of language, both linguistic and cognitive. We present simulation results with three simple classifiers - an ordinary nearest neighbour algorithm, Nosofsky's…

cmp-lg · Computer Science 2008-02-03 Ramin Charles Nakisa , Ulrike Hahn

Expressions with an aspectual variant of a light verb, e.g. 'take on debt' vs. 'have debt', are frequent in texts but often difficult to classify between verbal idioms, light verb constructions or compositional phrases. We investigate the…

Computation and Language · Computer Science 2026-05-12 Aggeliki Fotopoulou , Eric Laporte , Takuya Nakamura

We develop a method to incrementally construct programming languages. Our approach is categorical: each layer of the language is described as a monad. Our method either (i) concretely builds a distributive law between two monads, i.e.…

Logic in Computer Science · Computer Science 2018-10-08 Fredrik Dahlqvist , Louis Parlant , Alexandra Silva

Weir has defined a hierarchy of language classes whose second member ($\mathcal{L}_2$) is generated by tree-adjoining grammars (TAG), linear indexed grammars (LIG), combinatory categorial grammars, and head grammars. The hierarchy is…

Formal Languages and Automata Theory · Computer Science 2023-06-07 Alexandra Butoi , Ryan Cotterell , David Chiang