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
How to Split Recursive Automata
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Hi-index | 0.00 |
This paper presents learnability results from Typed Examples for some classes of Lambek Grammars, in the context of Gold's model of identification in the limit. Typed Examples are semantic information and we show that, as soon as syntax and semantics are connected by some compositional morphism, they allow to learn rich syntactic formalisms. A learning strategy is also presented and exemplified.