Partial match derivation using text analysis
First Claim
1. A computer implemented natural language processing method for resolving partial matches, comprising:
- receiving, using a computer processor, a natural language input query that does not fully specify an entity;
tokenizing, using the computer processor, the input query into a constituent set of query tokens;
searching, using the computer processor, an entity index by comparing the query tokens to contents of the index, the contents representing a plurality of entities, each of which is tokenized into a constituent set of entity tokens associated with the tokenized entity;
identifying, using the computer processor, a plurality of partial match query tokens from the set of query tokens, each partial match query token matching at least one entity token in the index;
determining, using the computer processor, whether a sequential break exists in the input query between the partial match query tokens;
for each partial match query token, determining, using the computer processor, the entity corresponding to each partial match query token by identifying the entity associated with each entity token in the index that matches the partial match query token;
determining, using the computer processor, whether there is an intersection between the identified entities corresponding to the partial match query tokens; and
when a sequential break exists in the input query between the partial match query tokens and there is no intersection between the identified entities corresponding to the partial match query tokensdetermining, using the computer processor, that the input query relates to a plurality of entities, andpresenting a response to the received natural language input query to a user based upon the identified entities.
1 Assignment
0 Petitions
Accused Products
Abstract
A natural language processing system and method resolves partial matches when a natural language input query does not fully specify an entity. The input query is tokenized into a set of query tokens, which are compared to contents of a searchable index, the contents representing entities, each of which is tokenized into a set of entity tokens associated with the tokenized entity. A plurality of partial match query tokens are identified from the set of query tokens, each partial match query token matching at least one entity token in the index. The entity(s) corresponding to each partial match query token are selected if a sequential break exists in the input query between the partial match query tokens and there is no intersection between the entity(s) corresponding to each partial match query token.
-
Citations
20 Claims
-
1. A computer implemented natural language processing method for resolving partial matches, comprising:
-
receiving, using a computer processor, a natural language input query that does not fully specify an entity; tokenizing, using the computer processor, the input query into a constituent set of query tokens; searching, using the computer processor, an entity index by comparing the query tokens to contents of the index, the contents representing a plurality of entities, each of which is tokenized into a constituent set of entity tokens associated with the tokenized entity; identifying, using the computer processor, a plurality of partial match query tokens from the set of query tokens, each partial match query token matching at least one entity token in the index; determining, using the computer processor, whether a sequential break exists in the input query between the partial match query tokens; for each partial match query token, determining, using the computer processor, the entity corresponding to each partial match query token by identifying the entity associated with each entity token in the index that matches the partial match query token; determining, using the computer processor, whether there is an intersection between the identified entities corresponding to the partial match query tokens; and when a sequential break exists in the input query between the partial match query tokens and there is no intersection between the identified entities corresponding to the partial match query tokens determining, using the computer processor, that the input query relates to a plurality of entities, and presenting a response to the received natural language input query to a user based upon the identified entities. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A natural language processing system for resolving partial matches, comprising:
-
a computer processor; an index stored in computer memory and searchable by the computer processor, the index having contents representing a plurality of entities, each entity having been tokenized into a constituent set of entity tokens associated with the tokenized entity; and computer memory, the computer memory storing a series of program instructions, wherein the program instructions are executable by the computer processor to; receive a natural language input query that does not fully specify an entity; tokenize the input query into a constituent set of query tokens; search the index by comparing the query tokens to the entity tokens in the index; identify a plurality of partial match query tokens from the set of query tokens, each partial match query token matching at least one entity token in the index; determine whether a sequential break exists in the input query between the partial match query tokens; for each partial match query token, determine the entity corresponding to each partial match query token by identifying the entity associated with each entity token in the index that matches the partial match query token; determine whether there is an intersection between the identified entities corresponding to the partial match query tokens; and when a sequential break exists in the input query between the partial match query tokens and there is no intersection between the identified entities corresponding to the partial match query tokens determine that the input query relates to a plurality of entities, and generate and provide a response to the received natural language input query to a user based upon the identified entities. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer implemented natural language processing method for resolving partial matches when a natural language input query does not fully specify an entity, comprising:
-
tokenizing, using a computer processor, the input query into a constituent set of query tokens; comparing the query tokens to contents of an index searchable by the processor, the contents representing a plurality of entities, each of which is tokenized into a constituent set of entity tokens associated with the tokenized entity; identifying, using the computer processor, a plurality of partial match query tokens from the set of query tokens, each partial match query token matching at least one entity token in the index; determining, using the computer processor, whether there is a sequential break in the input query between the partial match query tokens; for each partial match query token, identifying, using the computer processor, the entity associated with each entity token in the index that matches the partial match query token; determining, using the computer processor, whether there is an intersection between the identified entities corresponding to the partial match query tokens; and when a sequential break exists in the input query between the partial match query tokens and there is no intersection between the identified entities corresponding to the partial match query tokens determining, using the computer processor, that the input query relates to a plurality of entities, and generate and provide a response to the received natural language input query to a user based upon the identified entities. - View Dependent Claims (18, 19, 20)
-
Specification