Pith

open record

sign in

arxiv: 2109.04587 · v1 · pith:AIJV4SJU · submitted 2021-09-09 · cs.CL · cs.AI

Graph-Based Decoding for Task Oriented Semantic Parsing

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:AIJV4SJUrecord.jsonopen to challenge →

classification cs.CL cs.AI
keywords parsingdatadecodinggraph-basedsemantictaskdecodersformulate
0
0 comments X
read the original abstract

The dominant paradigm for semantic parsing in recent years is to formulate parsing as a sequence-to-sequence task, generating predictions with auto-regressive sequence decoders. In this work, we explore an alternative paradigm. We formulate semantic parsing as a dependency parsing task, applying graph-based decoding techniques developed for syntactic parsing. We compare various decoding techniques given the same pre-trained Transformer encoder on the TOP dataset, including settings where training data is limited or contains only partially-annotated examples. We find that our graph-based approach is competitive with sequence decoders on the standard setting, and offers significant improvements in data efficiency and settings where partially-annotated data is available.

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.