Disambiguating unrecognized abbreviations in search queries using machine learning
US-2024070178-A1 · Feb 29, 2024 · US
US2016253418A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016253418-A1 |
| Application number | US-201514634657-A |
| Country | US |
| Kind code | A1 |
| Filing date | Feb 27, 2015 |
| Priority date | Feb 27, 2015 |
| Publication date | Sep 1, 2016 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A system for generating synonyms of a search query includes a database for storing session logs including query data and a processor configured to execute computer-readable instructions for tying the search query to a category, analyzing query data of session logs to formulate groups of synonym candidates, selecting one of groups containing a synonym candidate that matches the search query, and filtering the selected group by tying each candidate of the selected group to a respective category, comparing the category of the search query with the category of each of the candidates of the selected group, and removing at least one candidate from the selected group to form a set of synonyms with each synonym being tied to a category that is common with the category of the search query. A method and one or more non-transitory computer-readable storage media for generating synonyms of a search query are also disclosed.
Opening claim text (preview).
What is claimed is: 1 . A system for generating synonyms of a search query, said system comprising: a database for storing a plurality of session logs with each session log including query data; a processor in communication with the database and configured to execute computer-readable instructions causing the processor to: tie the search query to a category; analyze the query data of the plurality of session logs to formulate a plurality of groups of synonym candidates; select one of the plurality of groups of synonym candidates containing a synonym candidate that matches the search query; and filter the selected group of synonym candidates by causing the processor to: tie each synonym candidate of the selected group of synonym candidates to a category; compare the category of the search query with the category of each of the synonym candidates of the selected group of synonym candidates; and remove at least one synonym candidate from the selected group of synonym candidates to form a set of synonyms with each synonym being tied to a category that is common with the category of the search query. 2 . The system as set forth in claim 1 wherein the processor is further configured to execute computer-readable instructions causing the processor to: collect the query data of each of the plurality of session logs from a corresponding session; organize the query data into the plurality of session logs; and store the plurality of session logs in the database. 3 . The system as set forth in claim 1 wherein the processor is further configured to execute computer-readable instructions causing the processor to reformulate the plurality of groups of synonym candidates so that each group of synonym candidates includes a plurality of synonym candidates having a frequency of occurring that exceeds a predetermined threshold value. 4 . The system as set forth in claim 1 wherein the computer-readable instructions causing the processor to filter the selected group of synonym candidates further causes the processor to remove at least one synonym candidate from the selected group of synonym candidates that has a spelling error. 5 . The system as set forth in claim 1 wherein the computer-readable instructions causing the processor to filter the selected group of synonym candidates further causes the processor to remove at least one synonym candidate from the selected group of synonym candidates that qualifies as a stemming query of an other synonym candidate of the selected group of synonym candidates. 6 . The system as set forth in claim 1 wherein the computer-readable instructions causing the processor to filter the selected group of synonym candidates further causes the processor to remove at least one synonym candidate from the selected group of synonym candidates that qualifies as a corner query. 7 . The system as set forth in claim 1 wherein the computer-readable instructions causing the processor to filter the selected group of synonym candidates further causes the processor to remove at least one synonym candidate from the selected group of synonym candidates that is mutually non-exclusive from an other synonym candidate of the selected group of synonym candidates. 8 . The system as set forth in claim 1 wherein the computer-readable instructions causing the processor to filter the selected group of synonym candidates further causes the processor to remove at least one synonym candidate from the selected group of synonym candidates that has an edit distance of three or more words from an other candidate of the selected group of synonym candidates. 9 . The system as set forth in claim 1 wherein the computer-readable instructions causing the processor to filter the selected group of synonym candidates further causes the processor to: collect category data during a session; and determine a frequency of an item being selected having a category that is common with the category of the search query. 10 . A method for generating synonyms of a search query with one or more steps of said method being performed utilizing a processor, said method comprising the steps of: tying the search query to a category; analyzing query data of a plurality of session logs to formulate a plurality of groups of synonym candidates; selecting one of the plurality of groups of synonym candidates containing a synonym candidate that matches the search query; filtering the selected group of synonym candidates, the filtering step including the steps of: tying each synonym candidate of the selected group of synonym candidates to a respective category; comparing the category of the search query with the category of each of the synonym candidates of the selected group of synonym candidates; and removing at least one synonym candidate from the selected group of synonym candidates to form a set of synonyms with each synonym being tied to a category that is common with the category of the search query. 11 . The method as set forth in claim 10 further comprising the steps of: collecting the query data of each of the plurality of session logs from a corresponding session; organizing the query data into the plurality of session logs; and storing the plurality of session logs in the database. 12 . The method as set forth in claim 10 further comprising the step of reformulating the plurality of groups of synonym candidates so that each group of synonym candidates includes a plurality of synonym candidates having a frequency of occurring that exceeds a predetermined threshold value. 13 . The method as set forth in claim 10 wherein the step of filtering the selected group of synonym candidates further comprises the step of removing at least one synonym candidate from the selected group of synonym candidates that has a spelling error. 14 . The method as set forth in claim 10 wherein the step of filtering the selected group of synonym candidates further comprises the step of removing at least one synonym candidate from the selected group of synonym candidates that qualifies as a stemming query of an other synonym candidate of the selected group of candidates. 15 . The method as set forth in claim 10 wherein the step of filtering the selected group of synonym candidates further comprises the step of removing at least one synonym candidate from the selected group of synonym candidates that qualifies as a corner query. 16 . The method as set forth in claim 10 wherein the step of filtering the selected group of synonym candidates further comprises the step of removing at least one synonym candidate from the selected group of synonym candidates that is mutually non-exclusive from an other synonym candidate of the selected group of synonym candidates. 17 . The method as set forth in claim 10 wherein the step of filtering the selected group of synonym candidates further comprises the step of removing at least one synonym candidate from the selected group of synonym candidates that has an edit distance of three or more words from an other candidate of the selected group of synonym candidates. 18 . The method as set forth in claim 10 wherein the step of filtering the selected group of synonym candidates further comprises the steps of: collecting category data during a session; and determining a frequency of an item being selected having a category that is common with the category of the search query. 19 . The method as set forth in claim 10 wherein the step of analyzing the query data of the plurality of session logs to form
Search customisation based on user profiles and personalisation · CPC title
using system suggestions (G06F16/3325 takes precedence) · CPC title
Physics · mapped topic
Physics · mapped topic
Thesauruses; Synonyms · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.