US 2017/0249382 A1Published application

Systems and methods for using a trained model for determining whether a query comprising multiple segments relates to an individual query or several queries

AssigneeRovi Guides, Inc.

InventorsSashikumar Venkataraman, Ahmed Nizam Mohaideen P, Manik Malhotra

Life of this patent

Estimating the term…

Loading patent…

Abstract

Systems and methods are provided herein for using a trained knowledge graph to accurately determine whether two phrases are conversationally connected. To this end, three phrases are received. The phrases are translated to strings of word types by determining what type of word each word of each phrase represents, and replacing each word of the first phrase with its respective type. A knowledge graph is then accessed to determine strengths of association between a combinations of each string of word types and any conversational category of a plurality of conversational categories. If any of the strengths of association exceed a threshold, the corresponding strings may be determined to be part of a conversation.

Claims21

Dependent claims

A method for using a trained knowledge graph to accurately determine whether two phrases are conversationally connected, the method comprising:

receiving a first phrase, a second phrase, and a third phrase;
translating the first phrase to a first string of word types by determining what type of word each word of the first phrase represents, and replacing each word of the first phrase with its respective type;
translating the second phrase to a second string of word types by determining what type of word each word of the second phrase represents, and replacing each word of the second phrase with its respective type;
translating the third phrase to a third string of word types by determining what type of word each word of the third phrase represents, and replacing each word of the third phrase with its respective type;
accessing a knowledge graph to determine:
a first strength of association between a combination of the first string and the second string and any conversational category of a plurality of conversational categories, and
a second strength of association between a combination of the second string and the third string and any conversational category of the plurality of conversational categories;
determining whether any of the first strength of association and the second strength of association exceed a threshold, and, responsive to the determining:
if both the first strength of association and the second strength of association exceed the threshold, determining that each of the first string, the second string, and the third string are part of a first conversation;
if the first strength of association exceeds the threshold, but the second strength of association does not exceed the threshold, determining that the first string and the second string are part of a second conversation that the third string is not a part of;
and
if the second strength of association exceeds the threshold, but the first strength of association does not exceed the threshold, determining that the second string and the third string are part of a third conversation that the first string is not a part of.

9 more elements

A system for using a trained knowledge graph to accurately determine whether two phrases are conversationally connected, the method comprising:

communications circuitry;
and
control circuitry configured to:
receive a first phrase, a second phrase, and a third phrase;
translate the first phrase to a first string of word types by determining what type of word each word of the first phrase represents, and replacing each word of the first phrase with its respective type;
translate the second phrase to a second string of word types by determining what type of word each word of the second phrase represents, and replacing each word of the second phrase with its respective type;
translate the third phrase to a third string of word types by determining what type of word each word of the third phrase represents, and replacing each word of the third phrase with its respective type;
access a knowledge graph to determine:
a first strength of association between a combination of the first string and the second string and any conversational category of a plurality of conversational categories, and
a second strength of association between a combination of the second string and the third string and any conversational category of the plurality of conversational categories;
determine whether any of the first strength of association and the second strength of association exceed a threshold, and, responsive to the determining:
if both the first strength of association and the second strength of association exceed the threshold, determine that each of the first string, the second string, and the third string are part of a first conversation;
if the first strength of association exceeds the threshold, but the second strength of association does not exceed the threshold, determine that the first string and the second string are part of a second conversation that the third string is not a part of;
and
if the second strength of association exceeds the threshold, but the first strength of association does not exceed the threshold, determine that the second string and the third string are part of a third conversation that the first string is not a part of.

12 more elements

Dependencies are inferred from the claim text.