Advertisement
Published in:
2011 | OriginalPaper | Chapter
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages
Authors : Denis Béchet, Alexandre Dikovsky, Annie Foret
Published in: Implementation and Application of Automata
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.