Learnable classes of categorial grammars
Learnable classes of categorial grammars
Generalized categorial dependency grammars
Pillars of computer science
k-valued non-associative lambek grammars (without product) form a strict hierarchy of languages
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Abstract automata and a normal form for categorial dependency grammars
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Two models of learning iterated dependencies
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
| Hi-index | 5.23 |
The notion of k-valued categorial grammars in which every word is associated to at most k types is often used in the field of lexicalized grammars as a fruitful constraint for obtaining interesting properties like the existence of learning algorithms. This constraint is reasonable only when the classes of k-valued grammars correspond to a real hierarchy of generated languages. Such a hierarchy has been established earlier for the classical categorial grammars. In this paper the hierarchy by the k-valued constraint is established in the class of categorial grammars extended with iterated types adapted to express the so called projective dependency structures.