Pith. sign in

REVIEW

Non-Autoregressive Semantic Parsing for Compositional Task-Oriented Dialog

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.04923 v1 pith:JVO5MR2J submitted 2021-04-11 cs.CL cs.LG

classification cs.CLcs.LG
keywords modelsparsingsemanticlatencynon-autoregressivearchitecturecomparedhigher
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Semantic parsing using sequence-to-sequence models allows parsing of deeper representations compared to traditional word tagging based models. In spite of these advantages, widespread adoption of these models for real-time conversational use cases has been stymied by higher compute requirements and thus higher latency. In this work, we propose a non-autoregressive approach to predict semantic parse trees with an efficient seq2seq model architecture. By combining non-autoregressive prediction with convolutional neural networks, we achieve significant latency gains and parameter size reduction compared to traditional RNN models. Our novel architecture achieves up to an 81% reduction in latency on TOP dataset and retains competitive performance to non-pretrained models on three different semantic parsing datasets. Our code is available at https://github.com/facebookresearch/pytext

Discussion (0). Sign in to comment.

Pith tools