Categorial grammars with iterated types form a strict hierarchy of k-valued languages - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2012

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

Denis Béchet
Annie Foret

Résumé

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.

Dates et versions

hal-00821823 , version 1 (13-05-2013)

Identifiants

Citer

Denis Béchet, Alexander Dikovsky, Annie Foret. Categorial grammars with iterated types form a strict hierarchy of k-valued languages. Theoretical Computer Science, 2012, 450, pp.22-30. ⟨10.1016/j.tcs.2012.04.024⟩. ⟨hal-00821823⟩
105 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More