Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Inductive inference of monotonic formal systems from positive data
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Generalized categorial dependency grammars
Pillars of computer science
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
On dispersed and choice iteration in incrementally learnable dependency types
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
Theoretical Computer Science
| Hi-index | 0.00 |
We study the learnability problem in the family of Categorial Dependency Grammars (CDG), a class of categorial grammars defining unlimited dependency structures. CDG satisfying a reasonable condition on iterated (i.e., repeatable and optional) dependencies are shown to be incrementally learnable in the limit.