Studia Logica

, Volume 87, Issue 2–3, pp 225–252

Learnability of Pregroup Grammars

Article

DOI: 10.1007/s11225-007-9085-2

Cite this article as:
Béchet, D., Foret, A. & Tellier, I. Stud Logica (2007) 87: 225. doi:10.1007/s11225-007-9085-2

Abstract

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.

Keywords

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

Copyright information

© Springer Science+Business Media B.V. 2007

Authors and Affiliations

  1. 1.LINA & CNRS FRE 2729Nantes Cedex 03France
  2. 2.IRISA & Université Rennes 1Rennes CedexFrance
  3. 3.GRAppA & Inria FutursUniversité Lille 3Villeneuve d’AscqFrance

Personalised recommendations