Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00821823
Contributor : Denis Béchet <>
Submitted on : Monday, May 13, 2013 - 10:57:54 AM
Last modification on : Friday, July 10, 2020 - 4:05:43 PM

Links full text

Identifiers

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⟩

Share

Metrics

Record views

259