A Graph-Based Spoken Dialog Strategy Utilizing Multiple Understanding Hypotheses
スポンサーリンク
概要
- 論文の詳細を見る
We regarded a dialog strategy for 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. In the search, we used a new criterion based on efficiency in information retrieval and consistency with understanding hypotheses, which is also used to select an appropriate system response. We showed that our system can make more efficient and natural dialogs than previous ones.
- Information and Media Technologies 編集運営会議の論文
Information and Media Technologies 編集運営会議 | 論文
- Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs
- A Quantitative Evaluation Methodology of Interconnection Networks
- Proposal and Performance Evaluation of Hash-based Authentication for P2P Network
- Resolving Direct and Indirect Anaphora for Japanese Definite Noun Phrases
- Ring Signatures: Universally Composable Definitions and Constructions