Between a Rock and a Hard Place – Parsing for Hyperege Replacement DAG Grammars
暂无分享,去创建一个
[1] Andrzej Ehrenfeucht,et al. On the membership problem for regular DNLC grammars , 1986, Discret. Appl. Math..
[2] Clemens Lautemann. The complexity of graph languages generated by hyperedge replacement , 2004, Acta Informatica.
[3] Berthold Hoffmann,et al. Predictive Top-Down Parsing for Hyperedge Replacement Grammars , 2015, ICGT.
[4] Fabienne Braune,et al. Mapping Between English Strings and Reentrant Semantic Graphs , 2014, LREC.
[5] 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..
[6] Annegret Habel,et al. Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.
[7] Jacob Andreas,et al. Parsing Graphs with Hyperedge Replacement Grammars , 2013, ACL.
[8] Annegret Habel,et al. Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.
[9] Philipp Koehn,et al. Abstract Meaning Representation for Sembanking , 2013, LAW@ACL.