Partially conservative learning is a variant of partial learning whereby the learner, on a text for a target language L, outputs one index e with L = We infinitely often and every further hypothesis d is output only finitely often and satisfies L 6⊆ Wd. The present paper studies the learning strength of this notion, comparing it with other learnability criteria such as confident partial learnin...

In [23], Valiant proposed a formal framework for distribution-free concept learning which has generated a great deal of interest. A fundamental result regarding this framework was proved by Blumer et al. [6] characterizing those concept classes which are learnable in terms of their Vapnik-Chervonenkis (VC) dimension. More recently, Benedek and Itai [4] studied learnability with respect to a fix...

This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...