Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
Learnable classes of categorial grammars
Learnable classes of categorial grammars
Handbook of Logic and Language
Handbook of Logic and Language
On Limit Points for Some Variants of Rigid Lambek Grammars
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Rigid grammars in the associative-commutative Lambek calculus are not learnable
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
k-valued non-associative Lambek categorial grammars are not learnable from strings
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Theoretical Computer Science - Logic, language, information and computation
| Hi-index | 0.00 |
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).We show that in contrast to classical categorial grammars, rigid and k-valued Lambek grammars are not learnable from strings. This result holds for variants of Lambek calculus; our proof consists in the construction of limit points in each class. Such a result aims at clarifying the possible directions for future learning algorithms.