English
Related papers

Related papers: Very strict selectional restrictions

200 papers

The verbalizer, which serves to map label words to class labels, is an essential component of prompt-tuning. In this paper, we present a novel approach to constructing verbalizers. While existing methods for verbalizer construction mainly…

Computation and Language · Computer Science 2024-07-16 Yong Ma , Senlin Luo , Yu-Ming Shang , Zhengjun Li , Yong Liu

We propose a cognitively and linguistically motivated set of sorts for lexical semantics in a compositional setting: the classifiers in languages that do have such pronouns. These sorts are needed to include lexical considerations in a…

Computation and Language · Computer Science 2013-12-12 Bruno Mery , Christian Retoré

Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of string…

Formal Languages and Automata Theory · Computer Science 2022-05-17 Andreas Maletti , Lena Katharina Schiffer

Distributional semantic models provide vector representations for words by gathering co-occurrence frequencies from corpora of text. Compositional distributional models extend these from words to phrases and sentences. In categorical…

Computation and Language · Computer Science 2018-10-10 Esma Balkir , Dimitri Kartsaklis , Mehrnoosh Sadrzadeh

Vector space models of word meaning all share the assumption that words occurring in similar contexts have similar meanings. In such models, words that are similar in their topical associations but differ in their logical force tend to…

Computation and Language · Computer Science 2023-10-24 Isabelle Lorge , Janet Pierrehumbert

German and French football language display tense-aspect-mood (TAM) forms which differ from the TAM use in other genres. In German football talk, the present indicative may replace the pluperfect subjunctive. In French reports of football…

Computation and Language · Computer Science 2021-09-20 Jakob Egetenmeyer

A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive…

Artificial Intelligence · Computer Science 2009-03-04 Claude-Guy Quimper , Toby Walsh

This paper demonstrates that metre is a privileged indicator of authorial style in classical Latin hexameter poetry. Using only metrical features, pairwise classification experiments are performed between 5 first-century authors (10…

Computation and Language · Computer Science 2019-12-03 Benjamin Nagy

Morphologically rich languages accentuate two properties of distributional vector space models: 1) the difficulty of inducing accurate representations for low-frequency word forms; and 2) insensitivity to distinct lexical relations that…

Computation and Language · Computer Science 2017-06-02 Ivan Vulić , Nikola Mrkšić , Roi Reichart , Diarmuid Ó Séaghdha , Steve Young , Anna Korhonen

GF(2)-grammars are a somewhat recently introduced grammar family that have some unusual algebraic properties and are closely connected to unambiguous grammars. In "Bounded languages described by GF(2)-grammars", Makarov proved a necessary…

Formal Languages and Automata Theory · Computer Science 2023-12-12 Vladislav Makarov , Marat Movsin

Descriptive grammars are highly valuable, but writing them is time-consuming and difficult. Furthermore, while linguists typically use corpora to create them, grammar descriptions often lack quantitative data. As for formal grammars, they…

Computation and Language · Computer Science 2024-03-27 Santiago Herrera , Caio Corro , Sylvain Kahane

Language Models, when generating prepositional phrases, must often decide for whether their complements functions as an instrumental adjunct (describing the verb adverbially) or an attributive modifier (enriching the noun adjectivally), yet…

Computation and Language · Computer Science 2025-09-30 Stefan Arnold , René Gröbner

Multiword expressions, characterised by non-compositional meanings and syntactic irregularities, are an example of nuanced language. These expressions can be used literally or idiomatically, leading to significant changes in meaning. While…

Computation and Language · Computer Science 2025-04-30 Frances Laureano De Leon , Harish Tayyar Madabushi , Mark G. Lee

A perspective of statistical language models which emphasizes their collocational aspect is advocated. It is suggested that strings be generalized in terms of classes of relationships instead of classes of objects. The single most important…

cmp-lg · Computer Science 2008-02-03 Robert John Freeman

Similes play an important role in literary texts not only as rhetorical devices and as figures of speech but also because of their evocative power, their aptness for description and the relative ease with which they can be combined with…

Computation and Language · Computer Science 2015-11-11 Suzanne Mpouli , Jean-Gabriel Ganascia

This research offers a new interdisciplinary approach to the field of Linguistics by using Computational Linguistics, NLP, Bayesian Statistics and Sociolinguistics methods. This thesis investigates word order change in infinitival clauses…

Computation and Language · Computer Science 2020-11-18 Olga Scrivner

We present a manually constructed seed lexicon encoding the inferential profiles of French event selecting predicates across different uses. The inferential profile (Karttunen, 1971a) of a verb is designed to capture the inferences…

Computation and Language · Computer Science 2017-10-04 Ingrid Falk , Fabienne Martin

Various methods have been proposed for aligning texts in two or more languages such as the Canadian Parliamentary Debates(Hansards). Some of these methods generate a bilingual lexicon as a by-product. We present an alternative alignment…

cmp-lg · Computer Science 2008-02-03 Pascale Fung , Kenneth Church

Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…

Logic in Computer Science · Computer Science 2023-07-11 Xinghan Liu , Emiliano Lorini

We study how multilingual sentence representations capture European countries and occupations and how this differs across European languages. We prompt the models with templated sentences that we machine-translate into 12 European languages…

Computation and Language · Computer Science 2023-10-26 Jindřich Libovický