(Re)introducing Regular Graph Languages

Distributions over strings and trees can be represented by probabilistic regular languages, which characterise many models in natural language processing. Recently, several datasets have become available which represent natural language phenomena as graphs, so it is natural to ask whether there is an equivalent of probabilistic regular languages for graphs. This paper presents regular graph languages, a formalism due to Courcelle (1991) that has not previously been studied in natural language processing. RGL is crucially a subfamily of both Hyperedge Replacement Languages (HRL), which can be made probabilistic; and Monadic Second Order Languages (MSOL), which are closed under intersection. We give an accessible introduction to Courcelle’s proof that RGLs are in MSOL, providing clues about how RGL may relate to other recently introduced graph grammar formalisms.

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

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

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

[4]  Mehryar Mohri,et al.  Speech Recognition with Weighted Finite-State Transducers , 2008 .

[5]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[6]  Taylor L. Booth,et al.  Applying Probability Measures to Abstract Languages , 1973, IEEE Transactions on Computers.

[7]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[8]  Henrik Björklund,et al.  Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars , 2016, LATA.

[9]  Thomas Noll,et al.  Tree-Like Grammars and Separation Logic , 2015, APLAS.

[10]  Michal Pilipczuk,et al.  Definability equals recognizability for graphs of bounded treewidth * , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[11]  Paul Gastin,et al.  Weighted automata and weighted logics , 2005, Theor. Comput. Sci..

[12]  Kevin Knight,et al.  Towards Probabilistic Acceptors and Transducers for Feature Structures , 2012, SSST@ACL.

[13]  Owen Rambow,et al.  Hyperedge Replacement and Nonprojective Dependency Structures , 2016, TAG.

[14]  Cyril Allauzen,et al.  Pushdown Automata in Statistical Machine Translation , 2014, CL.

[15]  Marie Mikulová,et al.  Announcing Prague Czech-English Dependency Treebank 2.0 , 2012, LREC.

[16]  Philipp Koehn,et al.  Abstract Meaning Representation for Sembanking , 2013, LAW@ACL.

[17]  Ari Rappoport,et al.  Universal Conceptual Cognitive Annotation (UCCA) , 2013, ACL.

[18]  Giora Slutzki,et al.  Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs , 1981, Inf. Control..

[19]  Xiaochang Peng,et al.  A Synchronous Hyperedge Replacement Grammar based approach for AMR parsing , 2015, CoNLL.

[20]  Alexander Koller,et al.  A Generalized View on Parsing and Translation , 2011, IWPT.

[21]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[22]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[23]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[24]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..