# US 2021/0279264 A1 · Systems and methods for interpreting a natural language search query using a neural network

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

- Number: US 2021/0279264 A1
- Document ID: US20210279264A1
- Status: Published application
- Kind: A1
- Application number: 16/807,422
- Filed: 2020-03-03
- Published: 2021-09-09
- Earliest claimed: 2020-03-03
- Applicants: Rovi Guides, Inc.
- Inventors: Jeffry Copps Robert Jose; Ajay Kumar Mishra
- Web page: https://patentgrep.com/patent/US20210279264A1

## CPC

- G06F 16/3344: {using natural language analysis}
- G06F 40/279: Recognition of textual entities
- G06F 16/3334: {Selection or weighting of terms from queries, including natural language queries}
- G06F 16/3347: {using vector based model}
- G06F 16/338: Presentation of query results
- G06F 40/20: Natural language analysis (semantic analysis of natural language G06F40/30)
- G06F 40/205: Parsing
- G06F 40/284: Lexical analysis, e.g. tokenisation or collocates
- G06F 40/295: Named entity recognition
- G06N 3/0499: Feedforward networks
- G06N 3/08: Learning methods
- G06N 3/09: Supervised learning
- G06N 3/045: Combinations of networks
- G06N 5/02: Knowledge representation; Symbolic representation
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A natural language search is interpreted through use of machine learning, such as using one or more neural networks. After identifying a number of terms in the natural language search query, a vector is generated for each term describing a relationship between each term and a plurality of other terms. Each vector is then input into a trained neural network that generates an output based on the input vectors. The natural language search query is then interpreted based on the output of the neural network.

## Claims

### Claim 1

A computer-implemented method for interpreting a natural language search query, the method comprising using processing circuitry for:
receiving the natural language search query;
identifying a plurality of terms in the natural language search query;
generating a respective vector for each term of the plurality of terms, wherein each vector describes a relationship between the respective term and a second plurality of terms;
inputting the respective vector for each term into a trained neural network that generates an output;
interpreting the natural language search query based on the output;
retrieving search results based on the interpreted search query; and
generating for display the search results.

### Claim 2 (depends on 1)

The method of claim 1, wherein identifying a plurality of terms in the natural language search query comprises:
splitting the natural language search query into a plurality of words;
analyzing a first word of the plurality of words;
determining, based on analyzing the first word, whether the first word can be part of a phrase;
in response to determining that the first word can be part of a phrase, analyzing the first word together with a second word that immediately follows the first word;
determining, based on analyzing the first word together with the second word, whether the first word and the second word form a phrase together;
in response to determining that the first word and the second word form a phrase together, identifying the first and second word as a single term; and
in response to determining that the first word does not form a phrase with the second word, identifying the first word as single term.

### Claim 3 (depends on 1)

The method of claim 1, wherein generating a respective vector for each term of the plurality of terms comprises:
accessing a knowledge graph associated with content metadata;
identifying plurality of terms to which each term of the plurality of terms connects in the knowledge graph;
calculating a distance between each respective term and each term connected to the respective term; and
generating a vector for each term based on the connections of each respective term and the distance between each respective term and each term to which each respective term is connected.

### Claim 4

A system for interpreting a natural language search query, the system comprising control circuitry configured to:
receive the natural language search query;
identify a plurality of terms in the natural language search query;
generate a respective vector for each term of the plurality of terms, wherein each vector describes a relationship between the respective term and a second plurality of terms;
input the respective vector for each term into a trained neural network that generates an output;
interpret the natural language search query based on the output;
retrieve search results based on the interpreted search query; and
generate for display the search results.

### Claim 5 (depends on 4)

The system of claim 4, wherein the control circuitry configured to identify a plurality of terms in the natural language search query is further configured to:
split the natural language search query into a plurality of words;
analyze a first word of the plurality of words;
determine, based on analyzing the first word, whether the first word can be part of a phrase;
in response to determining that the first word can be part of a phrase, analyze the first word together with a second word that immediately follows the first word;
determine, based on analyzing the first word together with the second word, whether the first word and the second word form a phrase together;
in response to determining that the first word and the second word form a phrase together, identify the first and second word as a single term; and
in response to determining that the first word does not form a phrase with the second word, identify the first word as single term.

### Claim 6 (depends on 4)

The system of claim 4, wherein the control circuitry configured to generate a respective vector for each term of the plurality of terms is further configured to:
access a knowledge graph associated with content metadata;
identify plurality of terms to which each term of the plurality of terms connects in the knowledge graph;
calculate a distance between each respective term and each term connected to the respective term; and
generate a vector for each term based on the connections of each respective term and the distance between each respective term and each term to which each respective term is connected.

### Claim at position 7

-9. (canceled)

### Claim 10

A non-transitory computer-readable medium having non-transitory computer-readable instructions encoded thereon for interpreting a natural language search query that, when executed by control circuitry, cause the control circuitry to:
receive the natural language search query;
identify a plurality of terms in the natural language search query;
generate a respective vector for each term of the plurality of terms, wherein each vector describes a relationship between the respective term and a second plurality of terms;
input the respective vector for each term into a trained neural network that generates an output;
interpret the natural language search query based on the output;
retrieve search results based on the interpreted search query; and
generate for display the search results.

### Claim 11 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein execution of the instruction to identify a plurality of terms in the natural language search query causes the control circuitry to:
split the natural language search query into a plurality of words;
analyze a first word of the plurality of words;
determine, based on analyzing the first word, whether the first word can be part of a phrase;
in response to determining that the first word can be part of a phrase, analyze the first word together with a second word that immediately follows the first word;
determine, based on analyzing the first word together with the second word, whether the first word and the second word form a phrase together;
in response to determining that the first word and the second word form a phrase together, identify the first and second word as a single term; and
in response to determining that the first word does not form a phrase with the second word, identify the first word as single term.

### Claim 12 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein execution of the instruction to generate a respective vector for each term of the plurality of terms causes the control circuitry to:
access a knowledge graph associated with content metadata;
identify plurality of terms to which each term of the plurality of terms connects in the knowledge graph;
calculate a distance between each respective term and each term connected to the respective term; and
generate a vector for each term based on the connections of each respective term and the distance between each respective term and each term to which each respective term is connected.

### Claim at position 11

-15 (canceled)
