Hostname: page-component-788cddb947-kc5xb Total loading time: 0 Render date: 2024-10-09T19:29:57.081Z Has data issue: false hasContentIssue false

Towards developing general models of usability with PARADISE

Published online by Cambridge University Press:  26 March 2001

MARILYN WALKER
Affiliation:
AT&T Labs – Research, 180 Park Avenue, Florham Park, NJ 07932-0971, USA; e-mail: walker@research.att.com, cak@research.att.com, diane@research.att.com
CANDACE KAMM
Affiliation:
AT&T Labs – Research, 180 Park Avenue, Florham Park, NJ 07932-0971, USA; e-mail: walker@research.att.com, cak@research.att.com, diane@research.att.com
DIANE LITMAN
Affiliation:
AT&T Labs – Research, 180 Park Avenue, Florham Park, NJ 07932-0971, USA; e-mail: walker@research.att.com, cak@research.att.com, diane@research.att.com

Abstract

The design of methods for performance evaluation is a major open research issue in the area of spoken language dialogue systems. This paper presents the PARADISE methodology for developing predictive models of spoken dialogue performance, and shows how to evaluate the predictive power and generalizability of such models. To illustrate the methodology, we develop a number of models for predicting system usability (as measured by user satisfaction), based on the application of PARADISE to experimental data from three different spoken dialogue systems. We then measure the extent to which the models generalize across different systems, different experimental conditions, and different user populations, by testing models trained on a subset of the corpus against a test set of dialogues. The results show that the models generalize well across the three systems, and are thus a first approximation towards a general performance model of system usability.

Type
Research Article
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)