Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars

rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan Abstract. Second-order abstract categorial grammars (de Groote 2001) and hyperedge replacement grammars (Bauderon and Courcelle 1987, Habel and Kreowski 1987) are two natural ways of generalizing “context-free” grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. 1991) or linear context-free rewriting systems (Weir 1988). In this paper, we give a simple, direct proof of the fact that second-order ACGs are simulated by hyperedge replacement grammars, which implies that the string and tree generating power of the former is included in that of the latter. The normal form for tree-generating hyperedge replacement grammars given by Engelfriet and Maneth (2000) can then be used ...

• Type: Journal
• Year: 2010
• Where: JOLLI
• Authors: Makoto Kanazawa
• Keywords: Grammars, Hyperedge Replacement, Hyperedge Replacement Grammars, JOLLI 2010