English
Related papers

Related papers: A Study on Learnability for Rigid Lambek Grammars

200 papers

A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…

Logic · Mathematics 2025-07-16 Sergey Slavnov

Free-text rationales justify model decisions in natural language and thus become likable and accessible among approaches to explanation across many tasks. However, their effectiveness can be hindered by misinterpretation and hallucination.…

Computation and Language · Computer Science 2025-06-04 Yi-Sheng Hsu , Nils Feldhus , Sherzod Hakimov

To what extent can a neural network systematically reason over symbolic facts? Evidence suggests that large pre-trained language models (LMs) acquire some reasoning capacity, but this ability is difficult to control. Recently, it has been…

Computation and Language · Computer Science 2020-11-17 Alon Talmor , Oyvind Tafjord , Peter Clark , Yoav Goldberg , Jonathan Berant

We study learners (computable devices) inferring formal languages, a setting referred to as language learning in the limit or inductive inference. In particular, we require the learners we investigate to be witness-based, that is, to…

Machine Learning · Computer Science 2020-10-20 Vanja Doskoč , Timo Kötzing

Large Language Models (LLMs) are typically aligned for safety during the post-training phase; however, they may still generate inappropriate outputs that could potentially pose risks to users. This challenge underscores the need for robust…

Machine Learning · Computer Science 2025-12-08 Mahesh Kumar Nandwana , Youngwan Lim , Joseph Liu , Alex Yang , Varun Notibala , Nishchaie Khanna

Word class flexibility refers to the phenomenon whereby a single word form is used across different grammatical categories. Extensive work in linguistic typology has sought to characterize word class flexibility across languages, but…

Computation and Language · Computer Science 2020-09-22 Bai Li , Guillaume Thomas , Yang Xu , Frank Rudzicz

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…

Logic · Mathematics 2024-01-23 Zachary Goodsell , Juhani Yli-Vakkuri

While context-free grammars are characterized by a simple proof-theoretic grammatical formalism namely categorial grammar and its logic the Lambek calculus, no such characterizations were known for tree-adjoining grammars, and even for any…

Computation and Language · Computer Science 2021-01-12 Hiroyoshi Komatsu

Evaluating Natural Language Generation (NLG) systems is a challenging task. Firstly, the metric should ensure that the generated hypothesis reflects the reference's semantics. Secondly, it should consider the grammatical quality of the…

Computation and Language · Computer Science 2022-03-18 Md Rashad Al Hasan Rony , Liubov Kovriguina , Debanjan Chaudhuri , Ricardo Usbeck , Jens Lehmann

Stabler proposes an implementation of the Chomskyan Minimalist Program, Chomsky 95 with Minimalist Grammars - MG, Stabler 97. This framework inherits a long linguistic tradition. But the semantic calculus is more easily added if one uses…

Computation and Language · Computer Science 2011-08-26 Maxime Amblard

Digital learning platforms enable students to learn on a flexible and individual schedule as well as providing instant feedback mechanisms. The field of STEM education requires students to solve numerous training exercises to grasp…

Computation and Language · Computer Science 2021-10-01 Stanley Uros Keller

Grounded language acquisition -- learning how language-based interactions refer to the world around them -- is amajor area of research in robotics, NLP, and HCI. In practice the data used for learning consists almost entirely of textual…

We consider the problem of fully unsupervised learning of grammatical (part-of-speech) categories from unlabeled text. The standard maximum-likelihood hidden Markov model for this task performs poorly, because of its weak inductive bias and…

Computation and Language · Computer Science 2014-01-24 João V. Graça , Kuzman Ganchev , Luisa Coheur , Fernando Pereira , Ben Taskar

In this paper, we reproduce the experiments of Artetxe et al. (2018b) regarding the robust self-learning method for fully unsupervised cross-lingual mappings of word embeddings. We show that the reproduction of their method is indeed…

Machine Learning · Computer Science 2020-03-04 Nicolas Garneau , Mathieu Godbout , David Beauchemin , Audrey Durand , Luc Lamontagne

The grammars of natural languages may be learned by using genetic algorithms that reproduce and mutate grammatical rules and part-of-speech tags, improving the quality of later generations of grammatical components. Syntactic rules are…

cmp-lg · Computer Science 2008-02-03 Robert M. Losee

The field of natural language understanding has experienced exponential progress in the last few years, with impressive results in several tasks. This success has motivated researchers to study the underlying knowledge encoded by these…

Artificial Intelligence · Computer Science 2021-06-03 Carlos Aspillaga , Marcelo Mendoza , Alvaro Soto

This paper explores the intricate relationship between interpretability and robustness in deep learning models. Despite their remarkable performance across various tasks, deep learning models often exhibit critical vulnerabilities,…

Machine Learning · Computer Science 2024-12-30 Navid Nayyem , Abdullah Rakin , Longwei Wang

Modality is one of the important components of grammar in linguistics. It lets speaker to express attitude towards, or give assessment or potentiality of state of affairs. It implies different senses and thus has different perceptions as…

Computation and Language · Computer Science 2015-04-21 Vishal Shukla

Reachability types are a recent proposal to bring Rust-style reasoning about memory properties to higher-level languages, with a focus on higher-order functions, parametric types, and shared mutable state -- features that are only partially…

Programming Languages · Computer Science 2025-10-10 Yuyan Bao , Songlin Jia , Guannan Wei , Oliver Bračevac , Tiark Rompf

How do humans learn language, and can the first language be learned at all? These fundamental questions are still hotly debated. In contemporary linguistics, there are two major schools of thought that give completely opposite answers.…

Computation and Language · Computer Science 2023-02-16 Kishore Surendra , Achim Schilling , Paul Stoewer , Andreas Maier , Patrick Krauss
‹ Prev 1 4 5 6 7 8 10 Next ›