# US 2021/0173834 A1 · Method and system for capturing and exploiting user intent in a conversational interaction based information retrieval system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0173834 A1
- Document ID: US20210173834A1
- Status: Published application
- Kind: A1
- Application number: 17/122,347
- Filed: 2020-12-15
- Published: 2021-06-10
- Earliest claimed: 2013-05-10
- Assignees: Veveo, Inc.
- Applicants: Veveo, Inc.
- Inventors: Murali Aravamudan; Sashikumar Venkataraman; Rakesh Barve; Ahmed Nizam Mohaideen Pathurudeen
- Web page: https://patentgrep.com/patent/US20210173834A1

## CPC

- G06F 16/2457: with adaptation to user needs
- G06F 16/95: Retrieval from the web
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems and methods are disclosed for processing a search request received from a user. A method includes providing access to content items associated with metadata. The method includes providing information about at least one search previously performed for a user, and providing access to information describing relationships between at least one of the content items and the metadata. The method includes receiving a present input from the user intended to identify a desired content item. Upon determining that results from the previous search did not satisfy the search request from the user, the method includes determining an intent shared by the previous search and the present input based on comparing (i) the relationship information, (ii) the previous search, and (iii) the present input. The method also includes selecting and presenting a subset of content items based on comparing the shared intent and the metadata.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A method comprising:
receiving a first search query and a second search query, wherein one of the first search query or the second search query indicates a window of time during which a user intends to view a media asset;
determining whether any media assets that match the first search query or the second search query are available in the window of time by determining whether any media assets that match the first search query or the second search query are scheduled for delivery during the window of time; and
in response to determining that no media assets that match the first search query or the second search query are available in the window of time:
identifying a category that is related to both the first search query and the second search query; and
generating one or more listings for media assets that are scheduled for delivery during the window of time and belong to the identified category.

### Claim 22 (depends on 21)

The method of claim 21, wherein identifying the category that is related to both the first search query and the second search query comprises:
calculating one or more distances in a relationship graph between a first attribute of a first search result that matches the first search query and a second attribute of a second search result that matches the second search query;
selecting one or more connections between the first attribute and the second attribute based on the calculated distances; and
identifying the category that is related to both the first search query and the second search query based on the selection connections in the relationship graph.

### Claim 23 (depends on 22)

The method of claim 22, wherein the relationship graph has a collection of nodes and edges, the edges representing direct connections between nodes, and wherein each of the calculated distances indicate the distance between two nodes in the relationship graph.

### Claim 24 (depends on 23)

The method of claim 23, wherein each of the calculated distances is measured in a number of hops between two nodes.

### Claim 25 (depends on 23)

The method of claim 23, wherein each edge has a weight and wherein each of the calculated distances is a combination of weights of edges connecting two nodes.

### Claim 26 (depends on 23)

The method of claim 23, wherein the calculated distance is based further on how often the nodes were used together according to the historical inputs.

### Claim 27 (depends on 22)

The method of claim 22, wherein at least one of the calculated distances is modified by user preferences acquired over time.

### Claim 28 (depends on 22)

The method of claim 22, wherein the first attribute comprises a first smart tag, a first category, or a first microcategory, and wherein at least one of the first smart tag, the first category, and the first microcategory are determined by applying a set of predetermined rules to the first search query or by applying a naïve Bayes classifier to the first search query.

### Claim 29 (depends on 22)

The method of claim 22, wherein the first attribute comprises a first smart tag, a first category, or a first microcategory, wherein the second attribute comprises a second smart tag, a second category, or a second microcategory, and wherein selecting the one or more connections between one or more of (a) the first smart tag and the second smart tag, (b) the first category and the second category, and (c) the first microcategory and the second microcategory based on the calculated distances comprises:
comparing the calculated distances between one or more of (a) the first smart tag and the second smart tag, (b) the first category and the second category, and (c) the first microcategory and the second microcategory;
determining whether one or more of the calculated distances is within a relationship distance threshold; and
in response to determining that one or more of the calculated distances is within a relationship distance threshold, selecting the one or more connections that are associated with calculated distances within the relationship distance threshold.

### Claim 30

A system comprising:
an electronic computing device configured to:
receive a first search query and a second search query, wherein one of the first search query or the second search query indicates a window of time during which a user intends to view a media asset;
determine whether any media assets that match the first search query or the second search query are available in the window of time by determining whether any media assets that match the first search query or the second search query are scheduled for delivery during the window of time; and
in response to determining that no media assets that match the first search query or the second search query are available in the window of time:
identify a category that is related to both the first search query and the second search query; and
generating one or more listings for media assets that are scheduled for delivery during the window of time and belong to the identified category.

### Claim 31 (depends on 30)

The system of claim 30, wherein the electronic computing device is further configured, when identifying the category that is related to both the first search query and the second search query, to:
calculate one or more distances in a relationship graph between a first attribute of a first search result that matches the first search query and a second attribute of a second search result that matches the second search query;
select one or more connections between the first attribute and the second attribute based on the calculated distances; and
identify the category that is related to both the first search query and the second search query based on the selection connections in the relationship graph.

### Claim 32 (depends on 31)

The system of claim 31, wherein the relationship graph has a collection of nodes and edges, the edges representing direct connections between nodes, and wherein each of the calculated distances indicate the distance between two nodes in the relationship graph.

### Claim 33 (depends on 32)

The system of claim 32, wherein each of the calculated distances is measured in a number of hops between two nodes.

### Claim 34 (depends on 32)

The system of claim 32, wherein each edge has a weight and wherein each of the calculated distances is a combination of weights of edges connecting two nodes.

### Claim 35 (depends on 32)

The system of claim 32, wherein the calculated distance is based further on how often the nodes were used together according to the historical inputs.

### Claim 36 (depends on 31)

The system of claim 31, wherein at least one of the calculated distances is modified by user preferences acquired over time.

### Claim 37 (depends on 31)

The system of claim 31, wherein the first attribute comprises a first smart tag, a first category, or a first microcategory, and wherein at least one of the first smart tag, the first category, and the first microcategory are determined by applying a set of predetermined rules to the first search query or by applying a naïve Bayes classifier to the first search query.

### Claim 38 (depends on 31)

The system of claim 31, wherein the first attribute comprises a first smart tag, a first category, or a first microcategory, wherein the second attribute comprises a second smart tag, a second category, or a second microcategory, and wherein the electronic computing device is further configured, when selecting the one or more connections, to:
compare the calculated distances between one or more of (a) the first smart tag and the second smart tag, (b) the first category and the second category, and (c) the first microcategory and the second microcategory;
determine whether one or more of the calculated distances is within a relationship distance threshold; and
in response to determining that one or more of the calculated distances is within a relationship distance threshold, select the one or more connections that are associated with calculated distances within the relationship distance threshold.

### Claim 39

A non-transitory machine-readable medium comprising non-transitory machine-readable instructions encoded thereon, the instructions comprising:
instructions for receiving a first search query and a second search query, wherein one of the first search query or the second search query indicates a window of time during which a user intends to view a media asset;
instructions for determining whether any media assets that match the first search query or the second search query are available in the window of time by determining whether any media assets that match the first search query or the second search query are scheduled for delivery during the window of time; and
instructions for, in response to determining that no media assets that match the first search query or the second search query are available in the window of time:
identifying a category that is related to both the first search query and the second search query; and
generating one or more listings for media assets that are scheduled for delivery during the window of time and belong to the identified category.

### Claim 40 (depends on 39)

The non-transitory machine-readable medium of claim 39, the non-transitory machine-readable medium further comprises instructions, identifying the category that is related to both the first search query and the second search query, for:
calculating one or more distances in a relationship graph between a first attribute of a first search result that matches the first search query and a second attribute of a second search result that matches the second search query;
selecting one or more connections between the first attribute and the second attribute based on the calculated distances; and
identifying the category that is related to both the first search query and the second search query based on the selection connections in the relationship graph.
