IP Library Granted Patent US 12,694,046
Granted Patent B2
US 12,694,046 · App. 18/736,118 · Granted Jul 28, 2026

Query correction based on reattempts learning

Inventors: Ajay Kumar Mishra (Bangalore, IN); Jeffry Copps Robert Jose (Chennai, IN)
Assignee: Adeia Guides Inc.
G06F16/3322G06F16/31G06F16/3329G06F16/3349G06N20/00
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 12,694,046
App. No.
18/736,118
Filed
Jun 6, 2024
Granted
Jul 28, 2026
Kind
B2
Art Unit
2159
USPC
707/767
Abstract

Systems and methods are described to access a set of reattempt query pairs, where each respective pair comprises an initial query and a reattempt of the initial query, and is associated with an indication of whether a reply generated for output based on the respective query pair was acceptable. In response to determining that a second query received after a first query constitutes a reattempt of the first query, a query pair in the set of reattempt query pairs may be identified that matches at least one of the first query and the second query, and is associated with an indication that a reply generated for output based on the query pair was acceptable. A search may be performed based on the identified query pair in the set of reattempt query pairs, and a reply may be generated for output based on the performed search.

Claims (88)

1 . A method comprising:

receiving a first input query and a second input query;

accessing a set of reattempt query pairs stored at a data structure, wherein each respective pair in the set:

comprises an initial query and a reattempt query; and

is associated with an indication of whether a reply generated for output based on the respective query pair was acceptable;

inputting, into a trained reattempt machine learning model, data indicative of the first input query and the second input query;

receiving, from the trained reattempt machine learning model, an output probability indicating the second input query constitutes a reattempt query of the first input query;

based at least in part on the output probability indicating that the second input query constitutes the reattempt query of the first input query, accessing the data structure to select a query pair from the set of reattempt query pairs based at least in part on receiving determinations that:

(a) the query pair is related to at least one of the first input query or the second input query, and

(b) the query pair is associated with an indication that a reply generated for output based on the query pair was acceptable;

performing a search based on the selected query pair in the set of the reattempt query pairs; and

generating for output a reply based on the performed search.

2 . The method of claim 1 , wherein performing the search comprises:

modifying the second input query based on at least one query of the selected query pair; and

performing the search using the modified query.

3 . The method of claim 1 , wherein selecting the query pair from the set of reattempt query pairs comprises:

comparing the first input query and the second input query to each query of the query pair; and

receiving a determination that at least one of the first input query or the second input query is an exact match of a query of the query pair.

4 . The method of claim 1 , wherein:

the reply generated for output based on the performed search comprises a selectable identifier for a content item;

the method further comprises, based on receiving a user selection of the selectable identifier, causing the content item to be generated for consumption by a user;

wherein the indication that the reply generated for output based on the performed search was acceptable is generated based on the content item being consumed by the user for a period of time greater than a threshold period of time.

5 . The method of claim 1 , wherein the set of reattempt query pairs is received from a plurality of users within a predetermined period of time from a current time, and the plurality of users belong to at least one of particular demographics or a particular geographic area.

6 . The method of claim 5 , wherein the set of reattempt query pairs is discarded after the predetermined period of time elapses.

7 . The method of claim 1 , wherein the trained reattempt machine learning model is obtained by training an untrained machine learning model using data associated with a plurality of reattempt query pairs.

8 . The method of claim 7 , wherein the data comprises at least one of phonetic word match information between the plurality of reattempt query pairs or parts of speech of terms in the plurality of reattempt query pairs.

9 . The method of claim 1 , wherein:

the set of reattempt query pairs stored at the data structure comprises a first query pair and a second query pair;

the selecting the query pair from the set of reattempt query pairs is based on receiving determinations of relationships between the first input query, the second input query, and queries from each of the first query pair and the second query pair comprising:

receiving a determination that the first input query matches a query from the first query pair;

receiving a determination that the second input query does not match the queries of the first query pair;

receiving a determination that neither of the first input query nor the second input query match the queries of the second query pair;

receiving a determination that a query from the first query pair that does not match the first input query nor the second input query matches a query from the second query pair; and

receiving a determination that the second query pair is associated with the indication that a reply generated for output based on the second query pair was acceptable; and

based on receiving the determinations of the relationships, the performing the search based on the identified query pair comprises performing the search using the second query pair.

10 . The method of claim 9 , wherein:

the first query pair includes a first initial query and a first reattempt query;

the second query pair includes a second initial query and a second reattempt query; and

the receiving determinations of identifying the relationships further comprises:

receiving a determination that the first input query matches the first reattempt query, and that the first input query does not match the first initial query, the second initial query, nor the second reattempt query;

receiving a determination that the second input query does not match the first initial query, the first reattempt query, the second initial query, nor the second reattempt query; and

receiving a determination that the first reattempt query of the first query pair matches the second initial query of the second query pair; and

based on receiving the determinations of the relationships, performing the search based on the identified query pair comprises performing the search using the second initial query of the second query pair.

11 . A system comprising:

a storage device; and

control circuitry configured to:

receive a first input query and a second input query;

access a set of reattempt query pairs stored at the storage device, wherein each respective pair in the set:

comprises an initial query and a reattempt query; and

is associated with an indication of whether a reply generated for output based on the respective query pair was acceptable;

input, into a trained reattempt machine learning model, data indicative of the first input query and the second input query;

receive, from the trained reattempt machine learning model, an output probability indicating the second input query constitutes a reattempt query of the first input query;

based at least in part on the output probability indicating that the second input query constitutes the reattempt query of the first input query, accessing the storage device to select a query pair from the set of reattempt query pairs, wherein:

(a) the query pair is related to at least one of the first input query or the second input query, and

(b) the query pair is associated with an indication that a reply generated for output based on the query pair was acceptable;

perform a search based on the query pair in the set of the reattempt query pairs; and

generate for output a reply based on the performed search.

12 . The system of claim 11 , wherein the control circuitry is configured to perform the search by:

modifying the second input query based on at least one query of the selected query pair; and

performing the search using the modified query.

13 . The system of claim 11 , wherein the control circuitry is configured to select the query pair from the set of reattempt query pairs by:

comparing the first input query and the second input query to each query of the query pair; and

receiving a determination that at least one of the first input query or the second input query is an exact match of a query of the query pair.

14 . The system of claim 11 , wherein:

the reply generated for output based on the performed search comprises a selectable identifier for a content item;

the control circuitry is configured to:

based on receiving a user selection of the selectable identifier, cause the content item to be generated for consumption by a user; and

generate the indication that the reply generated for output based on the performed search was acceptable based on the content item being consumed by the user for a period of time greater than a threshold period of time.

15 . The system of claim 11 , wherein the set of reattempt query pairs is received from a plurality of users within a predetermined period of time from a current time, and the plurality of users belong to at least one of particular demographics or a particular geographic area.

16 . The system of claim 15 , wherein the set of reattempt query pairs is discarded after the predetermined period of time elapses.

17 . The system of claim 11 , wherein the trained reattempt machine learning model is obtained by training an untrained machine learning model using data associated with a plurality of reattempt query pairs.

18 . The system of claim 17 , wherein the data comprises at least one of phonetic word match information between the plurality of reattempt query pairs or parts of speech of terms in the plurality of reattempt query pairs.

19 . The system of claim 11 , wherein the set of reattempt query pairs stored at the storage device comprises a first query pair and a second query pair;

the control circuitry is configured to select the query pair from the set of reattempt query pairs based on receiving determinations of relationships between the first input query, the second input query, and queries from each of the first query pair and the second query pair comprising:

receiving a determination that the first input query matches a query from the first query pair;

receiving a determination that the second input query does not match the queries of the first query pair;

receiving a determination that neither of the first input query nor the second input query match the queries of the second query pair;

receiving a determination that a query from the first query pair that does not match the first input query nor the second input query matches a query from the second query pair; and

receiving a determination that the second query pair is associated with the indication that a reply generated for output based on the second query pair was acceptable; and

based on receiving the determinations of the relationships, the performing the search based on the identified query pair comprises performing the search using the second query pair.

20 . The system of claim 19 , wherein:

the first query pair includes a first initial query and a first reattempt query;

the second query pair includes a second initial query and a second reattempt query; and

the control circuitry is configured to receive the determinations of the relationships further by:

receiving a determination that the first input query matches the first reattempt query, and that the first input query does not match the first initial query, the second initial query, nor the second reattempt query;

receiving a determination that the second input query does not match the first initial query, the first reattempt query, the second initial query, nor the second reattempt query; and

receiving a determination that the first reattempt query of the first query pair matches the second initial query of the second query pair; and

based on receiving the determinations of the relationships, performing the search based on the identified query pair comprises performing the search using the second initial query of the second query pair.

Assignments (3)
SECURITY INTEREST Recorded May 28, 2025
From: ADEIA INC. (F/K/A XPERI HOLDING CORPORATION); ADEIA HOLDINGS INC.; ADEIA MEDIA HOLDINGS INC.; ADEIA IMAGING LLC; ADEIA MEDIA LLC; ADEIA MEDIA SOLUTIONS INC.; ADEIA SEMICONDUCTOR BONDING TECHNOLOGIES INC.; ADEIA TECHNOLOGIES INC.; ADEIA GUIDES INC.; ADEIA SOLUTIONS LLC; ADEIA SEMICONDUCTOR ADVANCED TECHNOLOGIES INC.; ADEIA SEMICONDUCTOR SOLUTIONS LLC; ADEIA SEMICONDUCTOR INTELLECTUAL PROPERTY LLC; ADEIA SEMICONDUCTOR TECHNOLOGIES LLC; ADEIA PUBLISHING INC.
To: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
Reel/Frame 071454/0343 →
CHANGE OF NAME Recorded Oct 4, 2024
From: ROVI GUIDES, INC.
To: ADEIA GUIDES INC.
Reel/Frame 069113/0323 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 11, 2024
From: MISHRA, AJAY KUMAR; ROBERT JOSE, JEFFRY COPPS
To: ROVI GUIDES, INC.
Reel/Frame 067686/0873 →
Continuity (2)
Continuation 17218963 · Mar 31, 2021
Related Publication 20240403334A1 · Dec 5, 2024
References Cited (97)
US 6144958A · Ortega et al. · 2000 [cited by applicant]
US 6418432B1 · Cohen et al. · 2002 [cited by applicant]
US 6976019B2 · Davallou · 2005 [cited by applicant]
US 7231375B2 · Ratnaparkhi et al. · 2007 [cited by applicant]
US 7752201B2 · Anderson et al. · 2010 [cited by applicant]
US 8190627B2 · Platt · 2012 [cited by examiner]
US 8688667B1 · Kurzion · 2014 [cited by examiner]
US 9183257B1 · Buchanan et al. · 2015 [cited by applicant]
US 9424342B1 · Ravichandran · 2016 [cited by examiner]
US 9727906B1 · Sarmento et al. · 2017 [cited by applicant]
US 10404733B1 · Shavell · 2019 [cited by examiner]
US 10762083B2 · Firooz et al. · 2020 [cited by applicant]
US 10810193B1 · Subramanya et al. · 2020 [cited by applicant]
US 10860450B1 · Dageville et al. · 2020 [cited by applicant]
US 11133005B2 · Aher et al. · 2021 [cited by applicant]
US 11386105B2 · Fourney · 2022 [cited by examiner]
US 11526512B1 · Halabi · 2022 [cited by examiner]
US 11531671B2 · Shmueli · 2022 [cited by examiner]
US 11574020B1 · Zhai · 2023 [cited by examiner]
US 11580145B1 · Kumar · 2023 [cited by examiner]
US 11657030B2 · Cao · 2023 [cited by examiner]
US 11663278B2 · Xue · 2023 [cited by applicant]
US 11675795B2 · Yin et al. · 2023 [cited by applicant]
US 12038954B2 · Mishra · 2024 [cited by examiner]
US 12204533B2 · Robert Jose · 2025 [cited by examiner]
US 12400084B2 · Mohaideen P · 2025 [cited by examiner]
US 12518092B2 · Robert Jose · 2026 [cited by examiner]
US 12561315B2 · Rao · 2026 [cited by examiner]
US 20080114721A1 · Jones · 2008 [cited by examiner]
US 20080281808A1 · Anderson et al. · 2008 [cited by applicant]
US 20090070323A1 · Parikh · 2009 [cited by examiner]
US 20090187515A1 · Andrew et al. · 2009 [cited by applicant]
US 20090248665A1 · Garg et al. · 2009 [cited by applicant]
US 20090300493A1 · Hamilton et al. · 2009 [cited by applicant]
US 20110295897A1 · Gao · 2011 [cited by examiner]
US 20120254217A1 · Ali · 2012 [cited by examiner]
US 20120254218A1 · Ali · 2012 [cited by examiner]
US 20120296927A1 · Velipasaoglu · 2012 [cited by examiner]
US 20130124492A1 · Gao et al. · 2013 [cited by applicant]
US 20130185306A1 · Botros · 2013 [cited by applicant]
US 20140244661A1 · Peiris · 2014 [cited by examiner]
US 20140279995A1 · Wang · 2014 [cited by examiner]
US 20140337989A1 · Orsini et al. · 2014 [cited by applicant]
US 20150193447A1 · Voinea et al. · 2015 [cited by applicant]
US 20160012124A1 · Ruvini et al. · 2016 [cited by applicant]
US 20170011136A1 · Gabbai et al. · 2017 [cited by applicant]
US 20170017636A1 · Hasan · 2017 [cited by examiner]
US 20170161373A1 · Goyal et al. · 2017 [cited by applicant]
US 20170316065A1 · Fourney · 2017 [cited by examiner]
US 20170337199A1 · Kogan · 2017 [cited by examiner]
US 20170337326A1 · Zhang et al. · 2017 [cited by applicant]
US 20180121552A1 · Bostick et al. · 2018 [cited by applicant]
US 20180247247A1 · Xu · 2018 [cited by examiner]
US 20190034435A1 · Gubanov · 2019 [cited by examiner]
US 20190140997A1 · Lewin-Eytan et al. · 2019 [cited by applicant]
US 20190155929A1 · Kapoor · 2019 [cited by examiner]
US 20190164071A1 · Paugh et al. · 2019 [cited by applicant]
US 20190179940A1 · Ross et al. · 2019 [cited by applicant]
US 20190244484A1 · Nelson · 2019 [cited by applicant]
US 20190286749A1 · Mukherjee · 2019 [cited by applicant]
US 20200004813A1 · Galitsky · 2020 [cited by applicant]
US 20200042649A1 · Bakis · 2020 [cited by examiner]
US 20200057762A1 · Okajima · 2020 [cited by examiner]
US 20200202849A1 · Cartwright et al. · 2020 [cited by applicant]
US 20200272667A1 · Ding · 2020 [cited by examiner]
US 20200294071A1 · Christensen et al. · 2020 [cited by applicant]
US 20210056150A1 · Karandish et al. · 2021 [cited by applicant]
US 20210064503A1 · Dageville et al. · 2021 [cited by applicant]
US 20210191986A1 · Okajima et al. · 2021 [cited by applicant]
US 20210326742A1 · Rosset · 2021 [cited by examiner]
US 20210374130A1 · Lavi et al. · 2021 [cited by applicant]
US 20210397610A1 · Singh · 2021 [cited by examiner]
US 20220028373A1 · Li et al. · 2022 [cited by applicant]
US 20220086118A1 · Jain et al. · 2022 [cited by applicant]
US 20220091669A1 · Krishna et al. · 2022 [cited by applicant]
US 20220108143A1 · Volkerink et al. · 2022 [cited by applicant]
US 20220155441A1 · Sunegård · 2022 [cited by applicant]
US 20220172040A1 · Kazi · 2022 [cited by examiner]
US 20220207584A1 · Nakazawa et al. · 2022 [cited by applicant]
US 20220245706A1 · Chaidaroon · 2022 [cited by examiner]
US 20220277738A1 · Aher · 2022 [cited by examiner]
US 20220300560A1 · Filice et al. · 2022 [cited by applicant]
US 20220318283A1 · Mishra · 2022 [cited by examiner]
US 20220358166A1 · Hubauer et al. · 2022 [cited by applicant]
US 20220374434A1 · Nash et al. · 2022 [cited by applicant]
US 20220382818A1 · Chen · 2022 [cited by examiner]
US 20220391428A1 · Faruqui · 2022 [cited by examiner]
US 20230004601A1 · Rajan et al. · 2023 [cited by applicant]
US 20230074298A1 · Rome · 2023 [cited by examiner]
US 20230130267A1 · Mukherjee et al. · 2023 [cited by applicant]
US 20230409976A1 · Kimura et al. · 2023 [cited by applicant]
US 20240048518A1 · Jain et al. · 2024 [cited by applicant]
US 20240256535A1 · Robert Jose · 2024 [cited by examiner]
US 20240403334A1 · Mishra · 2024 [cited by examiner]
US 20250124076A1 · Majkowska · 2025 [cited by examiner]
Le et al., “Distributed Representations of Sentences and Documents,” In Proceedings of the 31st International Conference on Machine Learning, PMLR 32(2):1188-1196, 2014. [cited by applicant]
Mikolov et al., Efficient Estimation of Word Representations in Vector Space, ICLR Workshop, 2013. [cited by applicant]