Context-Sensitive Generation Network for Handing Unknown Slot Values in
Dialogue State Tracking
- URL: http://arxiv.org/abs/2005.03923v3
- Date: Fri, 16 Oct 2020 09:31:38 GMT
- Title: Context-Sensitive Generation Network for Handing Unknown Slot Values in
Dialogue State Tracking
- Authors: Puhai Yang, Heyan Huang, and Xian-Ling Mao
- Abstract summary: We propose a novel Context-Sensitive Generation network (CSG) which can facilitate the representation of out-of-vocabulary words.
Our proposed method performs better than the state-of-the-art baselines.
- Score: 38.96838255645715
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As a key component in a dialogue system, dialogue state tracking plays an
important role. It is very important for dialogue state tracking to deal with
the problem of unknown slot values. As far as we known, almost all existing
approaches depend on pointer network to solve the unknown slot value problem.
These pointer network-based methods usually have a hidden assumption that there
is at most one out-of-vocabulary word in an unknown slot value because of the
character of a pointer network. However, often, there are multiple
out-of-vocabulary words in an unknown slot value, and it makes the existing
methods perform bad. To tackle the problem, in this paper, we propose a novel
Context-Sensitive Generation network (CSG) which can facilitate the
representation of out-of-vocabulary words when generating the unknown slot
value. Extensive experiments show that our proposed method performs better than
the state-of-the-art baselines.
Related papers
- IntentDial: An Intent Graph based Multi-Turn Dialogue System with
Reasoning Path Visualization [24.888848712778664]
We present a novel graph-based multi-turn dialogue system called.
It identifies a user's intent by identifying intent elements and a standard query from a graph using reinforcement learning.
arXiv Detail & Related papers (2023-10-18T09:21:37Z) - PK-Chat: Pointer Network Guided Knowledge Driven Generative Dialogue
Model [79.64376762489164]
PK-Chat is a Pointer network guided generative dialogue model, incorporating a unified pretrained language model and a pointer network over knowledge graphs.
The words generated by PK-Chat in the dialogue are derived from the prediction of word lists and the direct prediction of the external knowledge graph knowledge.
Based on the PK-Chat, a dialogue system is built for academic scenarios in the case of geosciences.
arXiv Detail & Related papers (2023-04-02T18:23:13Z) - DAMO-NLP at SemEval-2022 Task 11: A Knowledge-based System for
Multilingual Named Entity Recognition [94.1865071914727]
MultiCoNER aims at detecting semantically ambiguous named entities in short and low-context settings for multiple languages.
Our team DAMO-NLP proposes a knowledge-based system, where we build a multilingual knowledge base based on Wikipedia.
Given an input sentence, our system effectively retrieves related contexts from the knowledge base.
Our system wins 10 out of 13 tracks in the MultiCoNER shared task.
arXiv Detail & Related papers (2022-03-01T15:29:35Z) - A Context-Aware Hierarchical BERT Fusion Network for Multi-turn Dialog
Act Detection [6.361198391681688]
CaBERT-SLU is a context-aware hierarchical BERT fusion Network (CaBERT-SLU)
Our approach reaches new state-of-the-art (SOTA) performances in two complicated multi-turn dialogue datasets.
arXiv Detail & Related papers (2021-09-03T02:00:03Z) - Ontology-Enhanced Slot Filling [3.024095356755364]
In multi-domain task-oriented dialog system, user utterances and system responses may mention multiple named entities and attributes values.
A system needs to select those that are confirmed by the user and fill them into destined slots.
One difficulty is that since a dialogue session contains multiple system-user turns, feeding in all the tokens into a deep model such as BERT can be challenging due to limited capacity of input word tokens and GPU memory.
arXiv Detail & Related papers (2021-08-25T14:54:47Z) - Instant One-Shot Word-Learning for Context-Specific Neural
Sequence-to-Sequence Speech Recognition [62.997667081978825]
We present an end-to-end ASR system with a word/phrase memory and a mechanism to access this memory to recognize the words and phrases correctly.
In this paper we demonstrate that through this mechanism our system is able to recognize more than 85% of newly added words that it previously failed to recognize.
arXiv Detail & Related papers (2021-07-05T21:08:34Z) - UCPhrase: Unsupervised Context-aware Quality Phrase Tagging [63.86606855524567]
UCPhrase is a novel unsupervised context-aware quality phrase tagger.
We induce high-quality phrase spans as silver labels from consistently co-occurring word sequences.
We show that our design is superior to state-of-the-art pre-trained, unsupervised, and distantly supervised methods.
arXiv Detail & Related papers (2021-05-28T19:44:24Z) - Streaming Multi-talker Speech Recognition with Joint Speaker
Identification [77.46617674133556]
SURIT employs the recurrent neural network transducer (RNN-T) as the backbone for both speech recognition and speaker identification.
We validate our idea on the Librispeech dataset -- a multi-talker dataset derived from Librispeech, and present encouraging results.
arXiv Detail & Related papers (2021-04-05T18:37:33Z) - A Post-processing Method for Detecting Unknown Intent of Dialogue System
via Pre-trained Deep Neural Network Classifier [23.25650237235107]
We propose SofterMax and deep novelty detection (SMDN) for detecting unknown intent in dialogue systems.
Our method can be flexibly applied on top of any classifiers trained in deep neural networks without changing the model architecture.
Our method classifies examples that differ from known intents as unknown and does not require any examples or prior knowledge of it.
arXiv Detail & Related papers (2020-03-07T03:29:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.