Improving Top-K Decoding for Non-Autoregressive Semantic Parsing via Intent Conditioning
Geunseob Oh, Rahul Goel, Chris Hidey, Shachi Paul, Aditya Gupta,, Pararth Shah, Rushin Shah

TL;DR
This paper introduces a novel non-autoregressive semantic parser with intent conditioning, enhancing top-k output diversity and quality while maintaining fast inference, suitable for conversational virtual assistants.
Contribution
It proposes intent conditioning in NAR semantic parsing to improve top-k output quality and diversity, addressing beam search challenges and maintaining O(1) decoding complexity.
Findings
Top-3 EM improved by 2.4 points
Speeds up beam search inference by 6.7x on CPU
Maintains competitive top-k EM with faster inference
Abstract
Semantic parsing (SP) is a core component of modern virtual assistants like Google Assistant and Amazon Alexa. While sequence-to-sequence-based auto-regressive (AR) approaches are common for conversational semantic parsing, recent studies employ non-autoregressive (NAR) decoders and reduce inference latency while maintaining competitive parsing quality. However, a major drawback of NAR decoders is the difficulty of generating top-k (i.e., k-best) outputs with approaches such as beam search. To address this challenge, we propose a novel NAR semantic parser that introduces intent conditioning on the decoder. Inspired by the traditional intent and slot tagging parsers, we decouple the top-level intent prediction from the rest of a parse. As the top-level intent largely governs the syntax and semantics of a parse, the intent conditioning allows the model to better control beam search and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Speech Recognition and Synthesis
