English
Related papers

Related papers: Very strict selectional restrictions

200 papers

In this paper, we describe an approach to sentence categorization which has the originality to be based on natural properties of languages with no training set dependency. The implementation is fast, small, robust and textual errors…

cmp-lg · Computer Science 2016-08-31 Emmanuel Giguet

Brazilian Portuguese and European Portuguese are two varieties of the same language and, despite their close similarities, they exhibit several differences. However, there is a significant disproportion in the availability of resources…

Computation and Language · Computer Science 2024-08-15 João Sanches , Rui Ribeiro , Luísa Coheur

The long-distance agreement, evidence for syntactic structure, is increasingly used to assess the syntactic generalization of Neural Language Models. Much work has shown that transformers are capable of high accuracy in varied agreement…

Computation and Language · Computer Science 2023-01-05 Bingzhi Li , Guillaume Wisniewski , Benoît Crabbé

Subject-verb agreement in the presence of an attractor noun located between the main noun and the verb elicits complex behavior: judgments of grammaticality are modulated by the grammatical features of the attractor. For example, in the…

Computation and Language · Computer Science 2023-11-29 Christos-Nikolaos Zacharopoulos , Théo Desbordes , Mathias Sablé-Meyer

A standard approach to evaluating language models analyzes how models assign probabilities to valid versus invalid syntactic constructions (i.e. is a grammatical sentence more probable than an ungrammatical sentence). Our work uses…

Computation and Language · Computer Science 2020-05-08 Forrest Davis , Marten van Schijndel

This paper proposes a method for extracting translations of morphologically constructed terms from comparable corpora. The method is based on compositional translation and exploits translation equivalences at the morpheme-level, which…

Computation and Language · Computer Science 2012-10-23 Estelle Delpech , Béatrice Daille , Emmanuel Morin , Claire Lemaire

We describe a novel technique and implemented system for constructing a subcategorization dictionary from textual corpora. Each dictionary entry encodes the relative frequency of occurrence of a comprehensive set of subcategorization…

cmp-lg · Computer Science 2016-08-31 Ted Briscoe , John Carroll

Selectional preference learning methods have usually focused on word-to-class relations, e.g., a verb selects as its subject a given nominal class. This paper extends previous statistical models to class-to-class preferences, and presents a…

Computation and Language · Computer Science 2007-05-23 Eneko Agirre , David Martinez

The ability to process idiomatic or literal multiword expressions is a crucial aspect of understanding and generating any language. The task of generating contextually relevant continuations for narratives containing idiomatic (or literal)…

Computation and Language · Computer Science 2023-11-07 Rhitabrat Pokharel , Ameeta Agrawal

The interpretation of the lexical aspect of verbs in English plays a crucial role for recognizing textual entailment and learning discourse-level inferences. We show that two elementary dimensions of aspectual class, states vs. events, and…

Computation and Language · Computer Science 2020-11-03 Thomas Kober , Malihe Alikhani , Matthew Stone , Mark Steedman

Semantic sentence embedding models encode natural language sentences into vectors, such that closeness in embedding space indicates closeness in the semantics between the sentences. Bilingual data offers a useful signal for learning such…

Computation and Language · Computer Science 2020-11-20 John Wieting , Graham Neubig , Taylor Berg-Kirkpatrick

We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages…

Formal Languages and Automata Theory · Computer Science 2022-09-01 Jürgen Dassow , Bianca Truthe

Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An important class of algebras are those that generate congruence…

Computational Complexity · Computer Science 2015-07-01 Emil Kiss , Matthew Valeriote

Previous work on English determiners has primarily concentrated on their semantics or scoping properties rather than their complex ordering behavior. The little work that has been done on determiner ordering generally splits determiners…

cmp-lg · Computer Science 2008-02-03 Beth Ann Hockey , Dania Egedi

Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…

Formal Languages and Automata Theory · Computer Science 2017-01-11 Thomas Place , Marc Zeitoun

Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. In their original definition, patterns only allow for…

Formal Languages and Automata Theory · Computer Science 2026-03-31 Klaus Jansen , Dirk Nowotka , Lis Pirotton , Corinna Wambsganz , Max Wiedenhöft

The separability problem for word languages of a class $\mathcal{C}$ by languages of a class $\mathcal{S}$ asks, for two given languages $I$ and $E$ from $\mathcal{C}$, whether there exists a language $S$ from $\mathcal{S}$ that includes…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Wojciech Czerwiński , Wim Martens , Lorijn van Rooijen , Marc Zeitoun , Georg Zetzsche

This paper develops a compositional vector-based semantics of subject and object relative pronouns within a categorical framework. Frobenius algebras are used to formalise the operations required to model the semantics of relative pronouns,…

Computation and Language · Computer Science 2014-05-14 Mehrnoosh Sadrzadeh , Stephen Clark , Bob Coecke

We analyze here a particular kind of linguistic network where vertices representwords and edges stand for syntactic relationships between words. The statisticalproperties of these networks have been recently studied and various features…

Statistical Mechanics · Physics 2007-05-23 Ramon Ferrer i Cancho , Andrea Capocci , Guido Caldarelli

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…

Formal Languages and Automata Theory · Computer Science 2009-03-09 Mikolaj Bojanczyk