DocumentCode
2330963
Title
Divided POMDP method for complex menu problems in spoken dialogue systems
Author
Habibi, Maryam ; Rahbar, Siavash ; Sameti, Hossein
Author_Institution
Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran, Iran
fYear
2010
fDate
12-15 Dec. 2010
Firstpage
484
Lastpage
489
Abstract
In this paper, a problem in spoken dialogue systems namely the menu problem, is introduced and solved by a POMDP model. To overcome the large size of the menu problem, a new method for achieving an optimal policy called divided POMDP method is introduced. Conditions for the problem to be solved by the proposed method are specified and the problem properties resulting in the given conditions are presented. The proposed method is evaluated using a typical menu problem with different menu sizes and it is shown that this method is superior to the conventional methods such as FRTDP for the problems it is capable to solve. Moreover, it converges faster in getting to an optimal policy.
Keywords
natural language processing; speech processing; complex menu problems; divided POMDP method; menu sizes; optimal policy; spoken dialogue systems; dialogue management; menu problem; partially observable Markov decision process; spoken dialogue systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Spoken Language Technology Workshop (SLT), 2010 IEEE
Conference_Location
Berkeley, CA
Print_ISBN
978-1-4244-7904-7
Electronic_ISBN
978-1-4244-7902-3
Type
conf
DOI
10.1109/SLT.2010.5700900
Filename
5700900
Link To Document