English
Related papers

Related papers: Mischievous Nominal Constructions in Universal Dep…

200 papers

In this paper we suggest a typed compositional seman-tics for nominal compounds of the form [Adj Noun] that models adjectives as higher-order polymorphic functions, and where types are assumed to represent concepts in an ontology that…

Computation and Language · Computer Science 2008-02-10 Walid S. Saba

The unigram distribution is the non-contextual probability of finding a specific word form in a corpus. While of central importance to the study of language, it is commonly approximated by each word's sample frequency in the corpus. This…

Computation and Language · Computer Science 2021-06-07 Irene Nikkarinen , Tiago Pimentel , Damián E. Blasi , Ryan Cotterell

We present an approach for assessing how multilingual large language models (LLMs) learn syntax in terms of multi-formalism syntactic structures. We aim to recover constituent and dependency structures by casting parsing as sequence…

Computation and Language · Computer Science 2023-09-21 Alberto Muñoz-Ortiz , David Vilares , Carlos Gómez-Rodríguez

A fundamental result in psycholinguistics is that less predictable words take a longer time to process. One theoretical explanation for this finding is Surprisal Theory (Hale, 2001; Levy, 2008), which quantifies a word's predictability as…

Computation and Language · Computer Science 2025-04-15 Ethan Gotlieb Wilcox , Tiago Pimentel , Clara Meister , Ryan Cotterell , Roger P. Levy

The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words. It is well-known that those edges normally do not cross when drawn over the sentence. Here a…

Computation and Language · Computer Science 2014-12-11 Ramon Ferrer-i-Cancho

Prior work has shown that large language models (LLMs) often converge to accurate input embedding for numbers, based on sinusoidal representations. In this work, we quantify that these representations are in fact strikingly systematic, to…

It has been claimed that within a language, morphologically irregular words are more likely to be phonotactically simple and morphologically regular words are more likely to be phonotactically complex. This inverse correlation has been…

Computation and Language · Computer Science 2024-06-11 Amanda Doucette , Ryan Cotterell , Morgan Sonderegger , Timothy J. O'Donnell

Transformer language models have received widespread public attention, yet their generated text is often surprising even to NLP researchers. In this survey, we discuss over 250 recent studies of English language model behavior before…

Computation and Language · Computer Science 2023-08-29 Tyler A. Chang , Benjamin K. Bergen

We discuss two constructions (long scrambling and ECM verbs) which challenge most syntactic theories (including traditional TAG approaches) since they seem to require exceptional mechanisms and postulates. We argue that these constructions…

cmp-lg · Computer Science 2008-02-03 Anthony Kroch , Owen Rambow

Natural language definitions possess a recursive, self-explanatory semantic structure that can support representation learning methods able to preserve explicit conceptual relations and constraints in the latent space. This paper presents a…

Computation and Language · Computer Science 2024-02-19 Marco Valentino , Danilo S. Carvalho , André Freitas

Existential rule languages are a family of ontology languages that have been widely used in ontology-mediated query answering (OMQA). However, for most of them, the expressive power of representing domain knowledge for OMQA, known as the…

Logic in Computer Science · Computer Science 2021-12-20 Heng Zhang

The paper presents a constraint based semantic formalism for HPSG. The advantages of the formlism are shown with respect to a grammar for a fragment of German that deals with (i) quantifier scope ambiguities triggered by scrambling and/or…

cmp-lg · Computer Science 2008-02-03 A. Frank , U. Reyle

In this paper we present a novel lemmatization method based on a sequence-to-sequence neural network architecture and morphosyntactic context representation. In the proposed method, our context-sensitive lemmatizer generates the lemma one…

Computation and Language · Computer Science 2020-04-16 Jenna Kanerva , Filip Ginter , Tapio Salakoski

Large language models (LLMs) are ubiquitous in modern day natural language processing. However, previous work has shown degraded LLM performance for under-represented English dialects. We analyze the effects of typifying "standard" American…

Computation and Language · Computer Science 2025-10-02 Eileen Pan , Anna Seo Gyeong Choi , Maartje ter Hoeve , Skyler Seto , Allison Koenecke

Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in…

Artificial Intelligence · Computer Science 2016-08-30 Van Hung Le

Transformer-based language models achieve high performance on various tasks, but we still lack understanding of the kind of linguistic knowledge they learn and rely on. We evaluate three models (BERT, RoBERTa, and ALBERT), testing their…

Computation and Language · Computer Science 2020-11-03 Marius Mosbach , Stefania Degaetano-Ortlieb , Marie-Pauline Krielke , Badr M. Abdullah , Dietrich Klakow

Sentence encoders map sentences to real valued vectors for use in downstream applications. To peek into these representations - e.g., to increase interpretability of their results - probing tasks have been designed which query them for…

Computation and Language · Computer Science 2020-10-29 Steffen Eger , Johannes Daxenberger , Iryna Gurevych

Large language models are increasingly relied upon as sources of information, but their propensity for generating false or misleading statements with high confidence poses risks for users and society. In this paper, we confront the critical…

The structure of a sentence can be represented as a network where vertices are words and edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have been observed to be infrequent in human languages. This…

Computation and Language · Computer Science 2017-12-13 Carlos Gómez-Rodríguez , Ramon Ferrer-i-Cancho

In this study, we propose a morpheme-based scheme for Korean dependency parsing and adopt the proposed scheme to Universal Dependencies. We present the linguistic rationale that illustrates the motivation and the necessity of adopting the…

Computation and Language · Computer Science 2022-09-21 Yige Chen , Eunkyul Leah Jo , Yundong Yao , KyungTae Lim , Miikka Silfverberg , Francis M. Tyers , Jungyeul Park
‹ Prev 1 8 9 10 Next ›