Graph parsing with s-graph grammars

Jonas Groschwitz, Alexander Koller, Christoph Teichmann

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

10 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationACL-IJCNLP 2015 - 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, Proceedings of the Conference
Place of PublicationStroudsburg
PublisherAssociation for Computational Linguistics (ACL)
Pages1481-1490
Number of pages10
Volume1
ISBN (Electronic)9781941643723
Publication statusPublished - 2015
Externally publishedYes
Event53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, ACL-IJCNLP - 2015 - Beijing, China
Duration: 26 Jul 201531 Jul 2015

Other

Other53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, ACL-IJCNLP - 2015
CountryChina
CityBeijing
Period26/07/1531/07/15

Fingerprint

Dive into the research topics of 'Graph parsing with s-graph grammars'. Together they form a unique fingerprint.

Cite this