AGIF: An Adaptive Graph-Interactive Framework for Joint Multiple Intent Detection and Slot Filling

• URL: http://arxiv.org/abs/2004.10087v4
• Date: Sat, 17 Oct 2020 04:28:29 GMT
• Title: AGIF: An Adaptive Graph-Interactive Framework for Joint Multiple Intent Detection and Slot Filling
• Authors: Libo Qin, Xiao Xu, Wanxiang Che, Ting Liu
• Abstract summary: In this paper, we propose an Adaptive Graph-Interactive Framework (AGIF) for joint multiple intent detection and slot filling. We introduce an intent-slot graph interaction layer to model the strong correlation between the slot and intents. Such an interaction layer is applied to each token adaptively, which has the advantage to automatically extract the relevant intents information.
• Score: 69.59096090788125
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In real-world scenarios, users usually have multiple intents in the same utterance. Unfortunately, most spoken language understanding (SLU) models either mainly focused on the single intent scenario, or simply incorporated an overall intent context vector for all tokens, ignoring the fine-grained multiple intents information integration for token-level slot prediction. In this paper, we propose an Adaptive Graph-Interactive Framework (AGIF) for joint multiple intent detection and slot filling, where we introduce an intent-slot graph interaction layer to model the strong correlation between the slot and intents. Such an interaction layer is applied to each token adaptively, which has the advantage to automatically extract the relevant intents information, making a fine-grained intent information integration for the token-level slot prediction. Experimental results on three multi-intent datasets show that our framework obtains substantial improvement and achieves the state-of-the-art performance. In addition, our framework achieves new state-of-the-art performance on two single-intent datasets.

Related papers

• MISCA: A Joint Model for Multiple Intent Detection and Slot Filling with Intent-Slot Co-Attention [9.414164374919029]
  Recent advanced approaches, which are joint models based on graphs, might still face two potential issues. We propose a joint model named MISCA. Our MISCA introduces an intent-slot co-attention mechanism and an underlying layer of label attention mechanism.
  arXiv  Detail & Related papers  (2023-12-10T03:38:41Z)
• Co-guiding for Multi-intent Spoken Language Understanding [53.30511968323911]
  We propose a novel model termed Co-guiding Net, which implements a two-stage framework achieving the mutual guidances between the two tasks. For the first stage, we propose single-task supervised contrastive learning, and for the second stage, we propose co-guiding supervised contrastive learning. Experiment results on multi-intent SLU show that our model outperforms existing models by a large margin.
  arXiv  Detail & Related papers  (2023-11-22T08:06:22Z)
• Tri-level Joint Natural Language Understanding for Multi-turn Conversational Datasets [5.3361357265365035]
  We present a novel tri-level joint natural language understanding approach, adding domain, and explicitly exchange semantic information between all levels. We evaluate our model on two multi-turn datasets for which we are the first to conduct joint slot-filling and intent detection.
  arXiv  Detail & Related papers  (2023-05-28T13:59:58Z)
• A Dynamic Graph Interactive Framework with Label-Semantic Injection for Spoken Language Understanding [43.48113981442722]
  We propose a framework termed DGIF, which first leverages the semantic information of labels to give the model additional signals and enriched priors. We propose a novel approach to construct the interactive graph based on the injection of label semantics, which can automatically update the graph to better alleviate error propagation.
  arXiv  Detail & Related papers  (2022-11-08T05:57:46Z)
• SLIM: Explicit Slot-Intent Mapping with BERT for Joint Multi-Intent Detection and Slot Filling [26.037061005620263]
  Utterance-level intent detection and token-level slot filling are two key tasks for natural language understanding (NLU) in task-oriented systems. We propose a multi-intent NLU framework, called SLIM, to jointly learn multi-intent detection and slot filling based on BERT.
  arXiv  Detail & Related papers  (2021-08-26T11:33:39Z)
• GL-GIN: Fast and Accurate Non-Autoregressive Model for Joint Multiple Intent Detection and Slot Filling [31.833158491112005]
  Multi-intent SLU can handle multiple intents in an utterance, which has attracted increasing attention. In this paper, we explore a non-autoregressive model for joint multiple intent detection and slot filling. Our framework achieves state-of-the-art performance while being 11.5 times faster.
  arXiv  Detail & Related papers  (2021-06-03T15:22:38Z)
• Learning Intents behind Interactions with Knowledge Graph for Recommendation [93.08709357435991]
  Knowledge graph (KG) plays an increasingly important role in recommender systems. Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents. We propose a new model, Knowledge Graph-based Intent Network (KGIN)
  arXiv  Detail & Related papers  (2021-02-14T03:21:36Z)
• Disentangled Graph Collaborative Filtering [100.26835145396782]
  Disentangled Graph Collaborative Filtering (DGCF) is a new model for learning informative representations of users and items from interaction data. By modeling a distribution over intents for each user-item interaction, we iteratively refine the intent-aware interaction graphs and representations. DGCF achieves significant improvements over several state-of-the-art models like NGCF, DisenGCN, and MacridVAE.
  arXiv  Detail & Related papers  (2020-07-03T15:37:25Z)
• Efficient Intent Detection with Dual Sentence Encoders [53.16532285820849]
  We introduce intent detection methods backed by pretrained dual sentence encoders such as USE and ConveRT. We demonstrate the usefulness and wide applicability of the proposed intent detectors, showing that they outperform intent detectors based on fine-tuning the full BERT-Large model. We release our code, as well as a new challenging single-domain intent detection dataset.
  arXiv  Detail & Related papers  (2020-03-10T15:33:54Z)

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.