The tree-generative capacity of combinatory categorial grammars

The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is investigated. It is demonstrated that the tree languages generated by CCGs can also be generated by simple monadic context-free tree grammars. However, the important subclass of pure combinatory cate...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 124; pp. 214 - 233
Main Authors:	Kuhlmann, Marco, Maletti, Andreas, Schiffer, Lena Katharina
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01-03-2022
Subjects:	Combinatory categorial grammar Linear context-free tree language Regular tree language Regular tree language Linear context-free tree language Combinatory categorial grammar
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is investigated. It is demonstrated that the tree languages generated by CCGs can also be generated by simple monadic context-free tree grammars. However, the important subclass of pure combinatory categorial grammars cannot even generate all regular tree languages. Additionally, the tree languages generated by combinatory categorial grammars with limited rule degrees are characterized: If only application rules are allowed, then these grammars can generate only a proper subset of the regular tree languages, whereas they can generate exactly the regular tree languages once first-degree composition rules are permitted.
ISSN:	0022-0000 1090-2724 1090-2724
DOI:	10.1016/j.jcss.2021.10.005