Modeling Graph Languages with Grammars Extracted via Tree Decompositions

Work on probabilistic models of natural language tends to focus on strings and trees, but there is increasing interest in more general graph-shaped structures since they seem to be better suited for representing natural language semantics, ontologies, or other varieties of knowledge structures. However, while there are relatively simple approaches to defining generative models over strings and trees, it has proven more challenging for more general graphs. This paper describes a natural generalization of the n-gram to graphs, making use of Hyperedge Replacement Grammars to define generative models of graph languages.

[1]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[2]  Daniel Gildea,et al.  Grammar Factorization by Tree Decomposition , 2011, Computational Linguistics.

[3]  Stephan Oepen,et al.  LinGO Redwoods , 2004 .

[4]  John F. Sowa,et al.  Conceptual Graphs for a Data Base Interface , 1976, IBM J. Res. Dev..

[5]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[6]  Mark Johnson,et al.  Estimators for Stochastic “Unification-Based” Grammars , 1999, ACL.

[7]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[8]  Ferenc Gécseg,et al.  Minimal ascending tree automata , 1978, Acta Cybern..

[9]  Radford M. Neal.  Pattern Recognition and Machine Learning , 2007, Technometrics.

[10]  Mark Johnson,et al.  Lexicalized Stochastic Modeling of Constraint-Based Grammars using Log-Linear Measures and EM Training , 2000, ACL.

[11]  Phong Le,et al.  Learning Compositional Semantics for Open Domain Semantic Parsing , 2012, COLING.

[12]  Michael White,et al.  Creating Disjunctive Logical Forms from Aligned Sentences for Grammar-Based Paraphrase Generation , 2011, Monolingual@ACL.

[13]  Jacob Andreas,et al.  Semantics-Based Machine Translation with Hyperedge Replacement Grammars , 2012, COLING.

[14]  Christopher D. Manning,et al.  The Stanford Typed Dependencies Representation , 2008, CF+CDPE@COLING.

[15]  Jacob Andreas,et al.  Parsing Graphs with Hyperedge Replacement Grammars , 2013, ACL.

[16]  Kevin Knight,et al.  An Overview of Probabilistic Tree Transducers for Natural Language Processing , 2005, CICLing.

[17]  Clemens Lautemann,et al.  Decomposition Trees: Structured Graph Representation and Efficient Algorithms , 1988, CAAP.

[18]  Ivan Titov,et al.  Online graph planarisation for synchronous parsing of semantic and syntactic dependencies , 2009, IJCAI 2009.

[19]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.