In this paper we describe a quantitative relation between the efficiency of dialogue control strategies, we measure by the average number of exchanges taken during a dialogue, and the performance of a speech recognition system used in a spoken dialogue system. We consider four dialogue control strategies: (1) direct confirmation, (2) indirect confirmation, (3) multiple item answer followed by direct confirmations, and (4) multiple item answer followed by multiple item confirmations. If n information items are necessary to execute a task, a status of a dialogue is represented by a triplet (u; k; c) (u+k+c=n), where u, k and c are the numbers of unknown, known not yet confirmed, and confirmed items respectively. The mathematical analyses of the strategies are based on the fact that the state transition of a dialogue can be represented by a Markov process in which a space of states are a set of triplets (u; k; c), and state transition probabilities are decided by a speech recognition rate and user's behaviors.
Cite as: Niimi, Y., Nishimoto, T. (1999) Mathematical analysis of dialogue control strategies. Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999), 1403-1406, doi: 10.21437/Eurospeech.1999-317
@inproceedings{niimi99_eurospeech,
author={Yasuhisa Niimi and Takuya Nishimoto},
title={{Mathematical analysis of dialogue control strategies}},
year=1999,
booktitle={Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999)},
pages={1403--1406},
doi={10.21437/Eurospeech.1999-317}
}