Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages - Archive ouverte HAL
Communication Dans Un Congrès Année : 2011

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 where a word is associated to at most k types is often used in the field of lexicalized grammars as a fruitful constraint for obtaining several properties like the existence of learning algorithms. This principle is relevant only when the classes of k-valued grammars correspond to a real hierarchy of languages. Such a property had been shown earlier for classical categorial grammars. This paper establishes the relevance of this notion when categorial grammars are enriched with iterated types.
Fichier non déposé

Dates et versions

hal-00820210 , version 1 (03-05-2013)

Identifiants

Citer

Denis Béchet, Alexander Dikovsky, Annie Foret. Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. 16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.42-52, ⟨10.1007/978-3-642-22256-6⟩. ⟨hal-00820210⟩
177 Consultations
0 Téléchargements

Altmetric

Partager

More