Rigid grammars in the associative-commutative Lambek calculus are not learnable

Authors:
Christophe Costa Florêncio
Affiliations:
Utrecht University
Venue:
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Year:
2003

Citing 6
Cited 0

Inductive inference from positive data is powerful

COLT '90 Proceedings of the third annual workshop on Computational learning theory
Structural control

Specifying syntactic structures
Learnable classes of categorial grammars

Learnable classes of categorial grammars
On Limit Points for Some Variants of Rigid Lambek Grammars

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Computional Learning of Languages

Computional Learning of Languages
Rigid Lambek grammars are not learnable from strings

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In (Kanazawa, 1998) it was shown that rigid Classical Categorial Grammars are learnable (in the sense of (Gold, 1967)) from strings. Surprisingly there are recent negative results for, among others, rigid associative Lambek (L) grammars.In this paper the non-learnability of the class of rigid grammars in LP (Associative-Commutative Lambek calculus) and LPø (same, but allowing the empty sequent in derivations) will be shown.