Add to ORKGInternational audienceKanazawa has proposed in Kanazawa (1998) several learnability results in Gold's model for categorial grammars. In this paper we explore the interests and limits of the method he used: we extend his main result to some subset of General Combinatory Grammars, and provide also a counter-example in order to locate the frontier of such a method
In Kanazawa (1998), the learnability of several parameterized families of categorial grammar classes...
International audienceIn this paper, we first study the connections between subclasses of AB-categor...
We apply a complexity theoretic notion of feasible learnability called polynomial learnability to ...
International audienceKanazawa has shown that k-valued classical categorial gram- mars have the prop...
Grammatical inference consists in discovering the rules governing how sentences of a language are fo...
In 1967 E. M. Gold published a paper in which the language classes from the Chomsky-hierarchy were a...
International audienceKanazawa has shown that several non-trivial classes of cate- gorial grammars a...
acceptance rate 41%Kanazawa has studied the learnability of several parameterized families of classe...
AbstractA number of natural models for learning in the limit are introduced to deal with the situati...
We present basic notions of Gold's "learnability in the limit" paradigm, first presented in 1967, a ...
In Gold's influential language learning paradigm a learning machine converges in the limit to one co...
We propose to apply a complexity theoretic notion of feasible learnability called polynomial learna...
AbstractIn Kanazawa (1998) [1], the learnability of several parameterized families of categorial gra...
In the present paper, we introduce a variant of Gold-style learners that is not required to infer pr...
This paper addresses the hypothesis that unnatural patterns generated by grammar formalisms can be e...
In Kanazawa (1998), the learnability of several parameterized families of categorial grammar classes...
International audienceIn this paper, we first study the connections between subclasses of AB-categor...
We apply a complexity theoretic notion of feasible learnability called polynomial learnability to ...
International audienceKanazawa has shown that k-valued classical categorial gram- mars have the prop...
Grammatical inference consists in discovering the rules governing how sentences of a language are fo...
In 1967 E. M. Gold published a paper in which the language classes from the Chomsky-hierarchy were a...
International audienceKanazawa has shown that several non-trivial classes of cate- gorial grammars a...
acceptance rate 41%Kanazawa has studied the learnability of several parameterized families of classe...
AbstractA number of natural models for learning in the limit are introduced to deal with the situati...
We present basic notions of Gold's "learnability in the limit" paradigm, first presented in 1967, a ...
In Gold's influential language learning paradigm a learning machine converges in the limit to one co...
We propose to apply a complexity theoretic notion of feasible learnability called polynomial learna...
AbstractIn Kanazawa (1998) [1], the learnability of several parameterized families of categorial gra...
In the present paper, we introduce a variant of Gold-style learners that is not required to infer pr...
This paper addresses the hypothesis that unnatural patterns generated by grammar formalisms can be e...
In Kanazawa (1998), the learnability of several parameterized families of categorial grammar classes...
International audienceIn this paper, we first study the connections between subclasses of AB-categor...
We apply a complexity theoretic notion of feasible learnability called polynomial learnability to ...