Results 1 
9 of
9
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 5 (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
Parsing CCGbank with the Lambek Calculus
, 2009
"... This paper will analyze CCGbank, a corpus of CCG derivations, for use with the Lambek calculus. We also present a Java implementation of the parsing algorithm for the Lambek calculus presented in Fowler (2009) and the results of experiments using that algorithm to parse the categories in CCGbank. We ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper will analyze CCGbank, a corpus of CCG derivations, for use with the Lambek calculus. We also present a Java implementation of the parsing algorithm for the Lambek calculus presented in Fowler (2009) and the results of experiments using that algorithm to parse the categories in CCGbank. We conclude that the Lambek calculus is computationally tractable for this task and provide insight into a full conversion of CCGbank to a bank of Lambek derivations.
Learning Lambek grammars from proof frames
"... Abstract. In addition to their limpid interface with semantics, the original categorial grammars introduced by Lambek 55 years ago enjoys another important property: learnability. After a short reminder on grammatical inference à la Gold, we provide an algorithm that learns rigid Lambek grammars wit ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In addition to their limpid interface with semantics, the original categorial grammars introduced by Lambek 55 years ago enjoys another important property: learnability. After a short reminder on grammatical inference à la Gold, we provide an algorithm that learns rigid Lambek grammars with product from proof frames that are name free proof nets a generalisation of functor argument structures to those grammars — that are already known to be unlearnable from strings, as shown by Foret and Le Nir. This result strictly encompasses our previous positive results on learning Lambek grammars without product The result can be extended to kvalued versions of these grammars using kunification although, as expected, algorithmic complexity becomes qui high. Our algorithm combines a proof net version of the principal type scheme algorithm of lambda calculus together with the unification algorithm for syntactic categories, as first explored by Buszkowski and Penn. We thereafter we provide a simple proof of the convergence of this algorithm inspired from the one by Kanazawa. Proof frames may seem complex structures to learn from, but they look like dependency structure that can be found in annotated corpora, and, as we show at the end of the paper, when the product is not used, proof frames exactly correspond to natural deduction frames that extend the functor argument structures that are commonly used for learning basic categorial grammars. We are sad to dedicate the present paper to Philippe Darondeau, with whom we started to study such questions in Rennes at the beginning of the millennium, and who passed away prematurely. We are glad to dedicate the present paper to Jim Lambek for his 90 birthday: he shows that research is an endless learning. 1
Rigid Lambek grammars are not learnable from strings
"... This paper is concerned with learning categorial grammars in Gold's model (Gold, 1967). Recently, learning algorithms in this model have been proposed for some particular classes of classical categorial grammars (Kanazawa, 1998). ..."
Abstract
 Add to MetaCart
(Show Context)
This paper is concerned with learning categorial grammars in Gold's model (Gold, 1967). Recently, learning algorithms in this model have been proposed for some particular classes of classical categorial grammars (Kanazawa, 1998).
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.
Noname manuscript No. (will be inserted by the editor) A Faithful Representation of NonAssociative Lambek Grammars in Abstract Categorial Grammars
"... Abstract This paper solves a natural but still open question: can Abstract Categorial Grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper s ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract This paper solves a natural but still open question: can Abstract Categorial Grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that NonAssociative Lambek grammars as well as their derivations can be defined using ACGs of order two. To conclude, the outcomes of such a representation are discussed. 1
Term Graphs and the NPcompleteness of the ProductFree Lambek Calculus
, 2009
"... We provide a graphical representation of proofs in the productfree Lambek calculus, called term graphs, that is related to several other proof net presentations. The advantage of term graphs is that they are very simple compared to the others. We use this advantage to provide an NPcompleteness pr ..."
Abstract
 Add to MetaCart
We provide a graphical representation of proofs in the productfree Lambek calculus, called term graphs, that is related to several other proof net presentations. The advantage of term graphs is that they are very simple compared to the others. We use this advantage to provide an NPcompleteness proof of the productfree Lambek Calculus that uses the reduction of [8]. Our proof is more intuitive due to the fact that term graphs allow arguments that are graphical in nature rather than using the algebraic arguments of [8].
A Faithful Representation of NonAssociative Lambek
, 2009
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
(Show Context)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Noname manuscript No. (will be inserted by the editor)