paper-with-me

Papers

Don't Parse, Generate! A Sequence to Sequence Architecture for Task-Oriented Semantic Parsing

2020-01-30 · Subendhu Rongali, Luca Soldaini, Emilio Monti, Wael Hamza

Virtual assistants such as Amazon Alexa, Apple Siri, and Google Assistant often rely on a semantic parsing component to understand which action(s) to execute for an utterance spoken by its users. Traditionally, rule-based or statistical slot-filling systems have been used to parse "simple" queries; that is, queries that contain a single action and can be decomposed into a set of non-overlapping entities. More recently, shift-reduce parsers have been proposed to process more complex utterances. These methods, while powerful, impose specific limitations on the type of queries that can be parsed; namely, they require a query to be representable as a parse tree. In this work, we propose a unified architecture based on Sequence to Sequence models and Pointer Generator Network to handle both simple and complex queries. Unlike other works, our approach does not impose any restriction on the semantic parse schema. Furthermore, experiments show that it achieves state of the art performance on three publicly available datasets (ATIS, SNIPS, Facebook TOP), relatively improving between 3.3% and 7.7% in exact match accuracy over previous systems. Finally, we show the effectiveness of our approach on two internal datasets.

📄 PDF Abstract BibTeX arXiv:2001.11458

Code (0)

등록된 구현이 없습니다.

Tasks

Semantic Parsingslot-fillingSlot Filling

Similar Papers 제목 키워드 기반

Exploiting Pre-trained Encoder-Decoder Transformers for Sequence-to-Sequence Constituent Parsing

2026-05-13 · Daniel Fernández-González, Cristina Outeiriño Cid arxiv

To achieve deep natural language understanding, syntactic constituent parsing plays a crucial role and is widely required by many artificial intelligence systems for processing both text and speech. A recent approach inv…

Natural Language UnderstandingConstituency ParsingMachine Translation

Generating Long Sequences with Sparse Transformers

2019-04-23 · Preprint 2019 4 · Rewon Child, Scott Gray, Alec Radford, Ilya Sutskever

Transformers are powerful sequence models, but require time and memory that grows quadratically with the sequence length. In this paper we introduce sparse factorizations of the attention matrix which reduce this to $O(n…

DiversityImage GenerationLanguage ModellingOpen-Domain Question Answering+1

Sparse Graph to Sequence Learning for Vision Conditioned Long Textual Sequence Generation

2020-07-12 · Aditya Mogadala, Marius Mosbach, Dietrich Klakow

Generating longer textual sequences when conditioned on the visual information is an interesting problem to explore. The challenge here proliferate over the standard vision conditioned sentence-level generation (e.g., im…

DecoderGraph-to-SequenceSentenceVideo Captioning

Understanding Unnatural Questions Improves Reasoning over Text

2020-10-19 · COLING 2020 8 · Xiao-Yu Guo, Yuan-Fang Li, Gholamreza Haffari

Complex question answering (CQA) over raw text is a challenging task. A prominent approach to this task is based on the programmer-interpreter framework, where the programmer maps the question into a sequence of reasonin…

DiversityNatural QuestionsQuestion Answering

Incorporating Syntactic Uncertainty in Neural Machine Translation with a Forest-to-Sequence Model

2018-08-01 · COLING 2018 8 · Poorya Zaremoodi, Gholamreza Haffari

Incorporating syntactic information in Neural Machine Translation (NMT) can lead to better reorderings, particularly useful when the language pairs are syntactically highly divergent or when the training bitext is not la…

Machine TranslationNMTSentenceTranslation