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

Authors:
Denis Béchet;Alexandre Dikovsky;Annie Foret
Affiliations:
LINA, UMR, CNRS, Université de Nantes, France;LINA, UMR, CNRS, Université de Nantes, France;IRISA, Université de Rennes 1, France
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 4
Cited 0

Learnable classes of categorial grammars

Learnable classes of categorial grammars
Generalized categorial dependency grammars

Pillars of computer science
k-valued non-associative lambek grammars (without product) form a strict hierarchy of languages

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Two models of learning iterated dependencies

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

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.