Combinatory categorial grammars as generators of weighted forests

DOI10.1016/J.IC.2023.105075OpenAlexW4385259462WikidataQ122615199 ScholiaQ122615199MaRDI QIDQ6053406

Lena Katharina Schiffer, Andreas Maletti

Publication date: 27 September 2023

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2023.105075

zbMATH Keywords

regular tree languagecommutative semiringcombinatory categorial grammarweighted tree languagelinear context-free tree language

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Combinatory logic. With two sections by William Craig.
• Handbook of weighted automata
• Recognizable formal power series on trees
• Multiple context-free tree grammars: lexicalization and characterization
• Spinal-formed context-free tree grammars
• The tree-generative capacity of combinatory categorial grammars
• Local Weighted Tree Languages
• The Mathematics of Sentence Structure
• The equivalence of four extensions of context-free grammars
• Weighted Tree Automata and Tree Transducers
• Context-free grammars on trees
• The Tree-Generative Capacity of Combinatory Categorial Grammars.

This page was built for publication: Combinatory categorial grammars as generators of weighted forests