Graph Transformation for Computational Linguistics

[1]  Daniel Grund,et al.  GrGen: A Fast SPO-Based Graph Rewriting Tool , 2006, ICGT.

[2]  Frank Drewes.  Recognising k-Connected Hypergraphs in Cubic Time , 1993, Theor. Comput. Sci..

[3]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.

[4]  Brink van der Merwe,et al.  Graph transformation for incremental natural language analysis , 2014, Theor. Comput. Sci..

[5]  Bruno Courcelle,et al.  Graph expressions and graph rewritings , 1987, Mathematical systems theory.

[6]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

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

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

[9]  Clemens Lautemann.  The complexity of graph languages generated by hyperedge replacement , 2004, Acta Informatica.

[10]  Joost Engelfriet,et al.  The String Generating Power of Context-Free Hypergraph Grammars , 1991, J. Comput. Syst. Sci..

[11]  Karl Moritz Hermann.  A Primer on Graph Processing with Bolinas , 2013 .

[12]  Sebastian Buchwald,et al.  GrGen.NET , 2010, International Journal on Software Tools for Technology Transfer.

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

[14]  Klaus-Jörn Lange,et al.  String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing , 1987, Discret. Appl. Math..

[15]  Walter Vogler,et al.  Recognizing Edge Replacement Graph Languages in Cubic Time , 1990, Graph-Grammars and Their Application to Computer Science.

[16]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.