IP Library Granted Patent US 10,872,080
Granted Patent B2
US 10,872,080 · App. 15/961,158 · Granted Dec 22, 2020

Reducing query ambiguity using graph matching

Inventors: Davood Shamsi (New York, NY); Wan Kim Mok (Brooklyn, NY); William Edward Pence (Bedford, NY)
Assignee: Oath Inc.
G06F16/2428G06F16/243G06F16/24522G06F16/9024G06F16/951G06F40/30
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,872,080
App. No.
15/961,158
Granted
Dec 22, 2020
Kind
B2
Abstract

Embodiments of the present invention provide systems, methods, and computer storage media directed at interpreting a query related to a dataset to reduce ambiguity of the query. In embodiments, a method includes determining potential meanings of words of a natural language query related to a particular dataset. A matching graph can be generated for the words of the query and the potential meanings for the words including similarity scores for the potential meanings. The method further includes reducing ambiguity of the matching graph by assigning selected potential meanings to the words. Upon reducing ambiguity of the matching graph, the matching graph can be used to provide a response to the query. Other embodiments may be described and/or claimed herein.

Claims (59)

1. A computer-implemented method for understanding queries, comprising:

determining potential meanings of portions of a query using a dataset, wherein the dataset includes metadata, event data, and specialized data;

generating a query graph, wherein the query graph comprises similarity scores for the potential meanings matched with the portions of the query, wherein the query graph comprises:

a first similarity score of a first meaning of a first portion of the query, wherein the first similarity score is based upon a first similarity of the first portion of the query to one or more portions of the dataset;

a second similarity score of a second meaning of the first portion of the query, wherein the second similarity score is based upon the first similarity of the first portion of the query to one or more portions of the dataset;

a third similarity score of a third meaning of a second portion of the query, wherein the third similarity score is based upon a second similarity of the second portion of the query to one or more portions of the dataset; and

a fourth similarity score of a fourth meaning of the second portion of the query, wherein the fourth similarity score is based upon the second similarity of the second portion of the query to one or more portions of the dataset;

reducing ambiguity of the query by assigning a single meaning to each of the portions of the query based upon the similarity scores, wherein the assigning comprises assigning the first meaning to the first portion of the query based upon the first similarity score of the first meaning and assigning the third meaning to the second portion of the query based upon the third similarity score of the third meaning; and

upon reducing ambiguity of the query, generating an answer to the query using the first meaning of the first portion of the query and the third meaning of the second portion of the query.

2. The computer-implemented method of claim 1 , wherein the similarity scores are generating using string matching based upon string comparison.

3. The computer-implemented method of claim 1 , wherein reducing ambiguity further comprises:

designating at least one of the portions of the query as a key word by assigning a potential meaning associated with the key word, wherein the key word indicates a main element being asked in the query.

4. The computer-implemented method of claim 1 , wherein reducing ambiguity further comprises:

selecting a potential meaning for a word when the potential meaning scores above a predetermined threshold.

5. The computer-implemented method of claim 1 , wherein reducing ambiguity further comprises:

selecting a first potential meaning for a word when the first potential meaning for the word is equivalent to a second potential meaning for the word.

6. The computer-implemented method of claim 1 , wherein reducing ambiguity further comprises:

analyzing an order of words to select a potential meaning for a word, the order of words indicating a relationship between the order of words with the potential meaning for the word.

7. The computer-implemented method of claim 1 , wherein reducing ambiguity further comprises:

presenting a clarification question to a user based upon failure to select one of the potential meanings for a word.

8. The computer-implemented method of claim 7 , wherein the clarification question is presented using one or more of a selectable multiple-choice list and asking to restate the query.

9. A non-transitory machine-readable storage medium including instructions which, when executed by a machine, cause the machine to:

determine potential meanings of words of a query using a dataset, wherein the dataset includes metadata, event data, and specialized data;

generate a query graph, wherein the query graph includes similarity scores for the potential meanings matched with the words of the query, wherein the query graph comprises:

a first similarity score of a first meaning of a first word of the query, wherein the first similarity score is based upon a first similarity of the first word of the query to one or more portions of the dataset;

a second similarity score of a second meaning of the first word of the query, wherein the second similarity score is based upon the first similarity of the first word of the query to one or more portions of the dataset;

a third similarity score of a third meaning of a second word of the query, wherein the third similarity score is based upon a second similarity of the second word of the query to one or more portions of the dataset; and

a fourth similarity score of a fourth meaning of the second word of the query, wherein the fourth similarity score is based upon the second similarity of the second word of the query to one or more portions of the dataset;

reduce ambiguity of the query by assigning a single meaning to at least one of the words of the query; and

upon reducing ambiguity of the query, generate an answer to the query using the query graph.

10. The non-transitory machine-readable storage medium of claim 9 , wherein the instructions further cause the machine to:

designate at least one of the words of the query as a key word; and

assign a potential meaning associated with the key word, wherein the key word indicates a main element being asked in the query.

11. The non-transitory machine-readable storage medium of claim 9 , wherein the instructions further cause the machine to:

select a potential meaning for a word when the potential meaning scores above a predetermined threshold.

12. The non-transitory machine-readable storage medium of claim 9 , wherein the instructions further cause the machine to:

select a first potential meaning for a word when the first potential meaning for the word is equivalent to a second potential meaning for the word.

13. The non-transitory machine-readable storage medium of claim 9 , wherein the instructions further cause the machine to:

analyze an order of words to select a potential meaning for a word, the order of words indicating a relationship between the order of words with the potential meaning for the word.

14. The non-transitory machine-readable storage medium of claim 9 , wherein the instructions further cause the machine to:

present a clarification question to a user based upon failure to select one of the potential meanings for a word.

15. A computer system comprising:

one or more processors; and

one or more computer storage media storing instructions that, when used by the one or more processors, cause the one or more processors to run an advertising system of one or more components configured to:

determine potential meanings of words of a query using a dataset, wherein the dataset includes metadata, event data, and specialized data;

generate a query graph, wherein the query graph includes similarity scores for the potential meanings matched with the words of the query;

reduce ambiguity of the query by assigning a single meaning to each of the words of the query based upon the similarity scores, wherein the assigning comprises assigning a first single meaning to a first word of the query based upon a first similarity score of the first single meaning and assigning a second single meaning to a second word of the query based upon a second similarity score of the second single meaning; and

upon reducing ambiguity of the query, generate an answer to the query using the first single meaning of the first word of the query and the second single meaning of the second word of the query.

16. The computer system of claim 15 , wherein the instructions further cause the one or more processors to:

designate at least one of the words of the query as a key word; and

assign a potential meaning associated with the key word, wherein the key word indicates a main element being asked in the query.

17. The computer system of claim 15 , wherein the instructions further cause the one or more processors to:

select a potential meaning for a word when the potential meaning scores above a predetermined threshold.

18. The computer system of claim 15 , wherein the instructions further cause the one or more processors to:

select a first potential meaning for a word when the first potential meaning for the word is equivalent to a second potential meaning for the word.

19. The computer system of claim 15 , wherein the instructions further cause the one or more processors to:

analyze an order of words to select a potential meaning for a word, the order of words indicating a relationship between the order of words with the potential meaning for the word.

20. The computer system of claim 15 , wherein the instructions further cause the one or more processors to:

present a clarification question to a user based upon failure to select one of a first potential meaning for a word and a second potential meaning for the word.

Assignments (3)
PATENT SECURITY AGREEMENT (FIRST LIEN) Recorded Sep 29, 2022
From: YAHOO ASSETS LLC
To: ROYAL BANK OF CANADA, AS COLLATERAL AGENT
Reel/Frame 061571/0773 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 16, 2021
From: YAHOO AD TECH LLC (FORMERLY VERIZON MEDIA INC.)
To: YAHOO ASSETS LLC
Reel/Frame 058982/0282 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2020
From: OATH INC.
To: VERIZON MEDIA INC.
Reel/Frame 054258/0635 →
Continuity (2)
Provisional Application 62489228 · Apr 24, 2017
Related Publication 20180307724A1 · Oct 25, 2018