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. (shrink)

The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises.

Alexandre Dikovsky is born in Leningrad, Russia on August 9, 1945. He died in Nantes, France in the beginning of 2014. He is well known for his significant contributions to the fields of Mathematics, Linguistics, and Informatics. In the course of his career, he published over 100 research papers, 12 book chapters, and participated in numerous national and international projects.