Recent graph-based models for joint multiple intent detection and slot filling have obtained promising results through modeling the guidance from the prediction of intents to the decoding of slot filling. However, existing methods (1) only model the \textit{unidirectional guidance} from intent to slot; (2) adopt \textit{homogeneous graphs} to model the interactions between the slot semantics nodes and intent label nodes, which limit the performance. In this paper, we propose a novel model termed Co-guiding Net, which implements a two-stage framework achieving the \textit{mutual guidances} between the two tasks. In the first stage, the initial estimated labels of both tasks are produced, and then they are leveraged in the second stage to model the mutual guidances. Specifically, we propose two \textit{heterogeneous graph attention networks} working on the proposed two \textit{heterogeneous semantics-label graphs}, which effectively represent the relations among the semantics nodes and label nodes. Experiment results show that our model outperforms existing models by a large margin, obtaining a relative improvement of 19.3\% over the previous best model on MixATIS dataset in overall accuracy.
翻译:用于联合多重意图探测和空档填充的最新图形模型通过从意图预测到空档填充解码的指南模型取得了有希望的成果。 但是,现有的方法(1) 从意图到空档只模拟\ textit{单向方向指导};(2) 采用\ textit{homongeneous 图形} 以模拟空槽语义节点和意图标签节点之间的互动,这限制了性能。在本文件中,我们提议了一个名为“共同指导网”的新颖模型,该模型在两个任务之间实施一个两阶段框架,实现\ textit{mupulal 指导}。在第一阶段,制作了这两项任务的初步估计标签,然后在第二阶段加以利用,以模拟共同指导。具体地说,我们提议了两个\ textitit{hentiveentive 图形关注网络},在拟议的两个文本{Heticenticulous semticles-lages}上工作,它有效地代表了语义节点和标签节点之间的关系。实验结果显示,我们的模型在19.3上比值的最佳模型超越了现有模型的比值。