Learnability of Pregroup Grammars

Studia Logica 87 (2-3):225-252 (2007)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,726

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
15 (#972,690)

6 months
6 (#736,944)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Toward discourse representation via pregroup grammars.Anne Preller - 2007 - Journal of Logic, Language and Information 16 (2):173-194.

Add more citations

References found in this work

Categorial Type Logics.Michael Moortgat - 1997 - In J. F. A. K. Van Benthem, Johan van Benthem & Alice G. B. Ter Meulen (eds.), Handbook of Logic and Language. Elsevier.
Mathematical linguistics and proof theory.Wojciech Buszkowski - 1997 - In J. F. A. K. Van Benthem, Johan van Benthem & Alice G. B. Ter Meulen (eds.), Handbook of Logic and Language. Elsevier. pp. 683--736.
Sequent systems for compact bilinear logic.Wojciech Buszkowski - 2003 - Mathematical Logic Quarterly 49 (5):467.

View all 8 references / Add more references