“…On the computational side, such rules must be governed by a well-defined grammar formalism. In particular, to manipulate graph construction in a principled way, Hyperedge Replacement Grammar (HRG; Drewes et al, 1997) and AM Algebra (Groschwitz et al, 2017) have been applied to build semantic parsers for various graph banks (Chen et al, 2018b;Groschwitz et al, 2018;Lindemann et al, 2019).…”