State Tracking Over Machine-Learned Relational Trees in a Dialog System

A method is provided for representing and updating the state of a dialog involving a series of queries and commands to an artificial intelligence system. Each statement within the dialogue may be modeled as a relational tree spanning nodes corresponding to named entities within the statement. A data...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: YEH PETER ZEIAN, DOUGLAS BENJAMIN BIRCH, RAMACHANDRAN DEEPAK, JARROLD WILLIAM LAWRENCE, RATNAPARKHI ADWAIT
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A method is provided for representing and updating the state of a dialog involving a series of queries and commands to an artificial intelligence system. Each statement within the dialogue may be modeled as a relational tree spanning nodes corresponding to named entities within the statement. A data structure may be used to store each of these trees and to modify them as the dialog progresses. A subsequent statement in the dialog may be parsed and its contents used to update an ongoing search initiated within that dialog. Statements may be used for the update process despite being fragmentary or not corresponding to any predetermined grammar. An algorithm is disclosed for updating the trees within the data structure after a new statement is parsed.