Categorial grammars with iterated types form a strict hierarchy of k-valued languages

Abstract : 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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2012, 450, pp.22-30. 〈10.1016/j.tcs.2012.04.024〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00821823
Contributeur : Denis Béchet <>
Soumis le : lundi 13 mai 2013 - 10:57:54
Dernière modification le : jeudi 17 mai 2018 - 12:52:03

Lien texte intégral

Identifiants

Citation

Denis Béchet, Alexander Dikovsky, Annie Foret. Categorial grammars with iterated types form a strict hierarchy of k-valued languages. Theoretical Computer Science, Elsevier, 2012, 450, pp.22-30. 〈10.1016/j.tcs.2012.04.024〉. 〈hal-00821823〉

Partager

Métriques

Consultations de la notice

174