Results 1 -
4 of
4
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
k-Valued Non-Associative Lambek Grammars Are Learnable From Function-Argument Structures
- ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2003
"... This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek grammars are learnable from function-argument structured sentences. In fact, function-argument structures are natural syntactical decompositions of sentences in sub- ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek grammars are learnable from function-argument structured sentences. In fact, function-argument structures are natural syntactical decompositions of sentences in sub-components with the indication of the head of each sub-component. This result is
k-valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings
- in: ACL (Ed.), Proccedings of the 41st Annual Meeting of the Association for Computational Linguistics (ACL
"... This paper is concerned with learning categorial grammars in Gold's model. In contrast to k-valued classical categorial grammars, k-valued Lambek grammars are not learnable from strings. This result was shown for several variants but the question was left open for the weakest one, the no ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper is concerned with learning categorial grammars in Gold's model. In contrast to k-valued classical categorial grammars, k-valued Lambek grammars are not learnable from strings. This result was shown for several variants but the question was left open for the weakest one, the non-associative variant NL.
On Intermediate Structures for Non-Associative Lambek Grammars and Learnability
, 2004
"... This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek (NL) grammars are not learnable from well-bracketed sentences. In contrast to ..."
Abstract
- Add to MetaCart
This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek (NL) grammars are not learnable from well-bracketed sentences. In contrast to