Results 1 
5 of
5
Learning rigid lambek grammars and minimalist grammars from structured sentences
 Third workshop on Learning Language in Logic, Strasbourg
, 2001
"... Abstract. We present an extension of Buszkowski’s learning algorithm for categorial grammars to rigid Lambek grammars and then for minimalist categorial grammars. The Kanazawa proof of the convergence in the Gold sense is simplified and extended to these new algorithms. We thus show that this techni ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present an extension of Buszkowski’s learning algorithm for categorial grammars to rigid Lambek grammars and then for minimalist categorial grammars. The Kanazawa proof of the convergence in the Gold sense is simplified and extended to these new algorithms. We thus show that this technique based on principal type algorithm and type unification is quite general and applies to learning issues for different type logical grammars, which are larger, linguistically more accurate and closer to semantics. 1
Resource logics and minimalist grammars
 Proceedings ESSLLI’99 workshop (Special issue Language and Computation
, 2002
"... This ESSLLI workshop is devoted to connecting the linguistic use of resource logics and categorial grammar to minimalist grammars and related generative grammars. Minimalist grammars are relatively recent, and although they stem from a long tradition of work in transformational grammar, they are lar ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
This ESSLLI workshop is devoted to connecting the linguistic use of resource logics and categorial grammar to minimalist grammars and related generative grammars. Minimalist grammars are relatively recent, and although they stem from a long tradition of work in transformational grammar, they are largely informal apart from a few research papers. The study of resource logics, on the other hand, is formal and stems naturally from a long logical tradition. So although there appear to be promising connections between these traditions, there is at this point a rather thin intersection between them. The papers in this workshop are consequently rather diverse, some addressing general similarities between the two traditions, and others concentrating on a thorough study of a particular point. Nevertheless they succeed in convincing us of the continuing interest of studying and developing the relationship between the minimalist program and resource logics. This introduction reviews some of the basic issues and prior literature. 1 The interest of a convergence What would be the interest of a convergence between resource logical investigations of
Proof theory and formal grammars: applications of normalization
 In Benedikt Löwe, Wolfgang Malzkom, and Thoralf Räsch, editors, Foundations of the formal sciences II
, 2003
"... One of the main areas of interaction between logic and linguistics in the last 20 years has been the proof theoretical approach to formal grammars. This approach dates back to Lambek’s work in the 1950s. Lambek proposed to ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
One of the main areas of interaction between logic and linguistics in the last 20 years has been the proof theoretical approach to formal grammars. This approach dates back to Lambek’s work in the 1950s. Lambek proposed to
Rigid Grammars in the AssociativeCommutative Lambek Calculus are not Learnable
, 2003
"... In (Kanazawa, 1998) it was shown that rigid Classical Catcgorial Gram mars are learnable (in the sense of (Gold, 1967)) from strings. Surpris ingly there are recent negative results for, among others, rigid associative Lambek (L) grammars. ..."
Abstract
 Add to MetaCart
(Show Context)
In (Kanazawa, 1998) it was shown that rigid Classical Catcgorial Gram mars are learnable (in the sense of (Gold, 1967)) from strings. Surpris ingly there are recent negative results for, among others, rigid associative Lambek (L) grammars.
Theoretical Informatics and Applications Informatique Théorique et Applications Will be set by the publisher LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES
"... Abstract. We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples. 1991 Mathematics Subject Classification. 68Q32,68T50,03B47. In 1988, I was a student in ”Maîtrise de Mathématques Discrêtes” at Lyon University, and Serge Grigorieff was one of my professors. I was fascinating by the course on computability that he gave. I followed him when he moved to the university Paris 7 and I made a master thesis on Kolmogorov complexity. Then I made a PhD thesis under his supervision. I got a lot out of our discussions and our works in his small office in Jussieu, and in particular the ability to ask questions and to study relationships between information, complexity and computability. We wrote together a paper on Kolmogorov complexity several years later, and I studied computational linguistic and grammatical inference, with the same spirit. This paper with Jérôme, which is my first PhD student, follows this line and is dedicated to him. I owe a lot to him and not only from a scientific point of view...