Abstract
This paper introduces the Finite-State Turn-Taking Machine (FSTTM), a new model to control the turn-taking behavior of conversational agents. Based on a non-deterministic finite-state machine, the FSTTM uses a cost matrix and decision theoretic principles to select a turn-taking action at any time. We show how the model can be applied to the problem of end-of-turn detection. Evaluation results on a deployed spoken dialog system show that the FSTTM provides significantly higher responsiveness than previous approaches. © 2009 Association for Computational Linguistics.
Cite
CITATION STYLE
Raux, A., & Eskenazi, M. (2009). A finite-state turn-taking model for spoken dialog systems. In NAACL HLT 2009 - Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Conference (pp. 629–637). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1620754.1620846
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
