Partially observable Markov decision processes for spoken dialog systems
Computer Speech and Language
Efficient model learning for dialog management
Proceedings of the ACM/IEEE international conference on Human-robot interaction
Finding approximate POMDP solutions through belief compression
Journal of Artificial Intelligence Research
AEMS: an anytime online search algorithm for approximate policy refinement in large POMDPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Dialogue Strategies to Overcome Speech Recognition Errors in Form-Filling Dialogue
ICCPOL '09 Proceedings of the 22nd International Conference on Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy
Data-driven user simulation for automated evaluation of spoken dialog systems
Computer Speech and Language
Effective handling of dialogue state in the hidden information state POMDP-based dialogue manager
ACM Transactions on Speech and Language Processing (TSLP)
Spoken dialogue in virtual worlds
COST'09 Proceedings of the Second international conference on Development of Multimodal Interfaces: active Listening and Synchrony
Hi-index | 0.00 |
This paper proposes a probabilistic framework for spoken dialog management using dialog examples. To overcome the complexity problems of the classic partially observable Markov decision processes (POMDPs) based dialog manager, we use a frame-based belief state representation that reduces the complexity of belief update. We also used dialog examples to maintain a reasonable number of system actions to reduce the complexity of the optimizing policy. We developed weather information and car navigation dialog system that employed a frame-based probabilistic framework. This framework enables people to develop a spoken dialog system using a probabilistic approach without complexity problem of POMDP.