Parsing Graphs with Hyperedge Replacement Grammars

Parsing Weighted Order-Preserving Hyperedge Replacement Grammars

Parsing Graphs with Regular Graph Grammars

Recently, several datasets have become available which represent natural language phenomena as graphs. Hyperedge Replacement Languages (HRL) have been the focus of much attention as a formalism to represent the graphs in…

Exact yet Efficient Graph Parsing, Bi-directional Locality and the Constructivist Hypothesis

A key problem in processing graph-based meaning representations is graph parsing, i.e. computing all possible derivations of a given graph according to a (competence) grammar. We demonstrate, for the first time, that exa…

Growing Graphs with Hyperedge Replacement Graph Grammars

Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we…

Factor Graph Grammars

We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate nota…