Combinatory categorial grammars as generators of weighted forests

• Published in: Information and computation Vol. 294; p. 105075
• Main Authors: Maletti, Andreas, Schiffer, Lena Katharina
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.10.2023
• Subjects: Combinatory categorial grammar; Commutative semiring; Linear context-free tree language; Regular tree language; Weighted tree language; Regular tree language; Weighted tree language; Combinatory categorial grammar; Linear context-free tree language; Commutative semiring
• ISSN: 0890-5401; 1090-2651
• DOI: 10.1016/j.ic.2023.105075

Combinatory Categorial Grammar (CCG) is an extension of categorial grammar that is well-established in computational linguistics. It is mildly context-sensitive, so it is efficiently parsable and reaches an expressiveness that is suitable for describing natural languages. Weighted CCG (wCCG) are introduced as a natural extension of CCG with weights taken from an arbitrary commutative semiring. Their expressive power is compared to other weighted formalisms with special emphasis on the weighted forests generated by wCCG since the ability to express the underlying syntactic structure of an input sentence is a vital feature of CCG in the area of natural language processing. Building on recent results for the expressivity in the unweighted setting, the corresponding results are derived for the weighted setting for any commutative semiring. More precisely, the weighted forests generatable by wCCG are also generatable by weighted simple monadic context-free tree grammar (wsCFTG). If the rule system is restricted to application rules and composition rules of first degree, then the generatable weighted forests are exactly the regular weighted forests. Finally, when only application rules are allowed, then a proper subset of the regular weighted forests is generatable.