2024-03-28T17:56:01Z
https://nagoya.repo.nii.ac.jp/oai
oai:nagoya.repo.nii.ac.jp:00012024
2023-01-16T04:32:38Z
312:313:314
Spoken dialog strategy based on understanding graph search
Kinoshita, Yuji
Miyajima, Chiyomi
Kitaoka, Norihide
Takeda, Kazuya
open access
©20xx IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
artificial intelligence
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverses the graph. To recover from misrecognition without seeking confirmation, our system kept multiple understanding hypotheses at each turn and searched for a globally optimal hypothesis in the graph whose nodes express understanding states across user utterances in a whole dialog. As for a dialog strategy, we introduced a new criterion based on efficiency in information retrieval and consistency with understanding hypotheses to select an appropriate system response. Using such criterion, the system removes the ambiguity so that users do not feel that a response that conflicts with the actual user intent is unnatural. We developed a spoken dialog system using these techniques and showed dialog examples in which misrecognition was naturally corrected. We also showed that our strategy was efficient in terms of the number of turns.
IEEE
2009-04-19
eng
journal article
VoR
http://hdl.handle.net/2237/13900
https://nagoya.repo.nii.ac.jp/records/12024
https://doi.org/10.1109/ICASSP.2009.4960704
1520-6149
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2009)
4797
4800
https://nagoya.repo.nii.ac.jp/record/12024/files/Kinoshita_ICASSO2009.pdf
application/pdf
260.1 kB
2018-02-20