Skip to Main content Skip to Navigation
Conference papers

Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00820210
Contributor : Denis Béchet <>
Submitted on : Friday, May 3, 2013 - 2:07:56 PM
Last modification on : Friday, July 10, 2020 - 4:01:10 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

336