Belief tracking with stacked relational trees

2Citations
Citations of this article
74Readers
Mendeley users who have this article in their library.

Abstract

We describe a new model for Dialog State Tracking called a Stacked Relational Tree, which naturally models complex relationships between entities across user utterances. It can represent multiple conversational intents and the change of focus between them. Updates to the model are made by a rule-based system in the language of tree regular expressions. We also introduce a probabilistic version that can handle ASR/NLU uncertainty. We show how the parameters can be trained from log data, showing gains on a variety of standard Belief Tracker metrics, and a measurable impact on the success rate of an end-to-end dialog system for TV program discovery.

Cite

CITATION STYLE

APA

Ramachandran, D., & Ratnaparkhi, A. (2015). Belief tracking with stacked relational trees. In SIGDIAL 2015 - 16th Annual Meeting of the Special Interest Group on Discourse and Dialogue, Proceedings of the Conference (pp. 68–76). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/w15-4609

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free