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 language | English |
|---|---|
| Title of host publication | ACL-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 Publication | Stroudsburg |
| Publisher | Association for Computational Linguistics (ACL) |
| Pages | 1481-1490 |
| Number of pages | 10 |
| Volume | 1 |
| ISBN (Electronic) | 9781941643723 |
| DOIs | |
| Publication status | Published - 2015 |
| Externally published | Yes |
| Event | 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, ACL-IJCNLP - 2015 - Beijing, China Duration: 26 Jul 2015 → 31 Jul 2015 |
Other
| Other | 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, ACL-IJCNLP - 2015 |
|---|---|
| Country/Territory | China |
| City | Beijing |
| Period | 26/07/15 → 31/07/15 |