Graph parsing with s-graph grammars

Jonas Groschwitz, Alexander Koller, and Christoph Teichmann

In Proceedings of the 53rd ACL and 7th IJCNLP, Beijing, 2015.

A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible analyses of a given graph according to a grammar. This problem arises in training synchronous string-to-graph grammars, and when generating strings from them. We present two algorithms for graph parsing (bottom-up and top-down) with s-graph grammars. On the related problem of graph parsing with hyperedge replacement grammars, our implementations outperform the best previous system by several orders of magnitude.

Download: Download

BibTeX Entry
@InProceedings{sgraph-parsing-15,
	author = {Jonas Groschwitz and Alexander Koller and Christoph Teichmann},
	title = {Graph parsing with s-graph grammars},
	booktitle = {Proceedings of the 53rd ACL and 7th IJCNLP},
	year = 2015,
	address = {Beijing}
}

Back: Publications