IntentDial: An Intent Graph based Multi-Turn Dialogue System with Reasoning Path Visualization

Zengguang Hao, Jie Zhang, Binxia Xu, Yafang Wang, Gerard de Melo +1 more
10/18/2023
cs.AI

No confident code implementation found for this paper.

Abstract

Intent detection and identification from multi-turn dialogue has become a widely explored technique in conversational agents, for example, voice assistants and intelligent customer services. The conventional approaches typically cast the intent mining process as a classification task. Although neural classifiers have proven adept at such classification tasks, the issue of neural network models often impedes their practical deployment in real-world settings. We present a novel graph-based multi-turn dialogue system called , which identifies a user's intent by identifying intent elements and a standard query from a dynamically constructed and extensible intent graph using reinforcement learning. In addition, we provide visualization components to monitor the immediate reasoning path for each turn of a dialogue, which greatly facilitates further improvement of the system.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hao2023intentdial,
  title  = {IntentDial: An Intent Graph based Multi-Turn Dialogue System with Reasoning Path Visualization},
  author = {Zengguang Hao and Jie Zhang and Binxia Xu and Yafang Wang and Gerard de Melo and Xiaolong Li},
  year   = {2023},
  eprint = {2310.11818},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.11818v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.11818.svg)](https://codeofpaper.com/paper/2310.11818)

Discussion