Studia Logica

, Volume 87, Issue 2, pp 225-252

First online:

Learnability of Pregroup Grammars

  • Denis BéchetAffiliated withLINA & CNRS FRE 2729 Email author 
  • , Annie ForetAffiliated withIRISA & Université Rennes 1
  • , Isabelle TellierAffiliated withGRAppA & Inria Futurs, Université Lille 3

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 called feature-tagged examples. A learning algorithm based on the parsing strategy presented in the first part is given. Its validity is proved and its properties are examplified.


Learning from positive examples Pregroup grammars Computational linguistics parsing Categorial Grammars constraints