pith. sign in

arxiv: 1808.07624 · v1 · pith:3QCMTX7Knew · submitted 2018-08-23 · 💻 cs.CL · cs.AI

Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model

classification 💻 cs.CL cs.AI
keywords syntacticinformationmodelgraphdependencyexperimentalfeaturesgraph-to-sequence
0
0 comments X
read the original abstract

Existing neural semantic parsers mainly utilize a sequence encoder, i.e., a sequential LSTM, to extract word order features while neglecting other valuable syntactic information such as dependency graph or constituent trees. In this paper, we first propose to use the \textit{syntactic graph} to represent three types of syntactic information, i.e., word order, dependency and constituency features. We further employ a graph-to-sequence model to encode the syntactic graph and decode a logical form. Experimental results on benchmark datasets show that our model is comparable to the state-of-the-art on Jobs640, ATIS and Geo880. Experimental results on adversarial examples demonstrate the robustness of the model is also improved by encoding more syntactic information.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.