IP Library Granted Patent US 12,468,765
Granted Patent B2
US 12,468,765 · App. 17/934,688 · Granted Nov 11, 2025

Machine learning techniques for generating personalized autocomplete prediction

Inventors: Laura D. Hamilton (Chicago, IL); Ayush Tomar (Morgan Hill, CA); Vinit Garg (Fremont, CA); Lun Yu (San Francisco, CA)
Assignee: Optum, Inc.
G06F16/90324G06F16/2428G06F16/24578G06F16/9535
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,468,765
App. No.
17/934,688
Granted
Nov 11, 2025
Kind
B2
Abstract

Various embodiments of the present invention provide methods, apparatus, systems, computing devices, computing entities, and/or the like for performing personalized autocomplete predictions. Certain embodiments of the present invention utilize systems, methods, and computer program products that perform personalized autocomplete predictions using a general search corpus and/or individual curated search corpus.

Claims (59)

1 . A computer-implemented method comprising:

receiving, by one or more processors, a search query prefix;

generating, by the one or more processors, a set of session-agnostic autocomplete scores for a set of candidate search results by:

generating a first subset of the set of session-agnostic autocomplete scores for a first subset of the set of candidate search results within an individual curated search corpus based at least in part on an edit distance measure between the search query prefix and each of the first subset of the set of candidate search results, and

generating a second subset of the set of session-agnostic autocomplete scores for a second subset of the set of candidate search results within a general search result corpus based at least in part on a trie-based frequency score that is generated based at least in part on one or more qualifying trie leaf node subsets of a general search result corpus trie data object for the general search result corpus and a general corpus historical frequency score for each of the second subset of the set of candidate search results;

generating, by the one or more processors, a set of session-aware autocomplete scores for the set of candidate search results;

generating (i) a weighted set of session-agnostic autocomplete scores by applying a first weight measure to the set of session-agnostic autocomplete scores and (ii) a weighted set of session-aware autocomplete scores by applying a second weight measure to the set of session-aware autocomplete scores, wherein the first weight measure exceeds the second weight measure; and

wherein (i) a weighted summation, of the set of weighted summations, for the candidate search result comprises a weighted combination of at least one weighted session-agnostic autocomplete score of the weighted set of session-agnostic autocomplete scores and at least one weighted session-aware autocomplete score of the weighted set of session-aware autocomplete scores, and (ii) a weight of the weighted combination is based at least in part on a presence of the candidate search result within the individual curated search corpus or the general search result corpus;

generating, by the one or more processors, a set of hybrid autocomplete scores for the set of candidate search results based at least in part on the set of weighted summations between the first subset of the set of session-agnostic autocomplete scores, the second subset of the set of session-agnostic autocomplete scores, and the set of session-aware autocomplete scores, wherein the set of weighted summations is based at least in part on one or more locations of a candidate search result of the set of candidate search results, and the one or more locations comprise the individual curated search corpus or the general search result corpus;

generating, by the one or more processors, a ranked autocomplete prediction based at least in part on the set of hybrid autocomplete scores; and

initiating, using the one or more processors, the performance of one or more prediction-based actions based at least in part on the ranked autocomplete prediction.

2 . The computer-implemented method of claim 1 , wherein generating a session-aware autocomplete score of the set of session-aware autocomplete scores for the candidate search result of the set of candidate search results comprises:

identifying a search result cluster for the candidate search result;

determining that the search result cluster is in a qualifying search result cluster set for the search query prefix, wherein the qualifying search result cluster set comprises each search result cluster of a set of search result clusters that is generated by performing one or more two-means clustering operations on fixed-size search result representations for the set of candidate search results in a candidate search result corpus;

in response to determining that the search result cluster is in the qualifying search result cluster, generating, using a per-cluster matching machine learning model for the search result cluster, a per-cluster match result indicator for the search result cluster, and

in response to determining that the per-cluster match result indicator for the search result cluster is an affirmative per-cluster match result indicator:

(a) generating, using a cross-cluster ranking machine learning model, a qualifying result ranking score for the candidate search result, and

(b) generating the session-aware autocomplete score for the candidate search result based at least in part on the qualifying result ranking score.

3 . The computer-implemented method of claim 2 , wherein the qualifying search result cluster set comprises each search result cluster that: (i) corresponds to a leaf node of a height-fixed candidate search result corpus trie data object, and (ii) corresponds to the search query prefix.

4 . The computer-implemented method of claim 1 , wherein the individual curated search corpus comprises: (i) one or more visited provider designators for a query-generating user profile associated with the search query prefix, and (ii) for each visited provider designator, one or more related provider designators.

5 . The computer-implemented method of claim 1 , wherein the individual curated search corpus comprises: (i) one or more visited provider designators for a query-generating user profile associated with the search query prefix, and (ii) for each visited provider designator, one or more qualified related provider designators that satisfy one or more provider qualification criteria.

6 . The computer-implemented method of claim 5 , wherein the one or more provider qualification criteria comprise a location criterion characterized by a location feature for the query-generating user profile associated with the search query prefix.

7 . The computer-implemented method of claim 1 , wherein the set of weighted summations is based at least in part on a trie-based frequency score weight measure and an edit distance weight measure.

8 . The computer-implemented method of claim 7 , wherein the edit distance weight measure exceeds the trie-based frequency score weight measure.

9 . The computer-implemented method of claim 1 , wherein the set of session-aware autocomplete scores for the set of candidate search results is based at least in part on a determination that the search query prefix is associated with a series of search queries over a period of time.

10 . A system comprising one or more processors and at least one memory storing processor-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:

receiving a search query prefix;

generating a set of session-agnostic autocomplete scores for a set of candidate search results by:

generating a first subset of the set of session-agnostic autocomplete scores for a first subset of the set of candidate search results within an individual curated search corpus based at least in part on an edit distance measure between the search query prefix and each of the first subset of the set of candidate search results, and

generating a second subset of the set of session-agnostic autocomplete scores for a second subset of the set of candidate search results within a general search result corpus based at least in part on a trie-based frequency score that is generated based at least in part on one or more qualifying trie leaf node subsets of a general search result corpus trie data object for the general search result corpus and a general corpus historical frequency score for each of the second subset of the set of candidate search results;

generating a set of session-aware autocomplete scores for the set of candidate search results;

generating (i) a weighted set of session-agnostic autocomplete scores by applying a first weight measure to the set of session-agnostic autocomplete scores and (ii) a weighted set of session-aware autocomplete scores by applying a second weight measure to the set of session-aware autocomplete scores, wherein the first weight measure exceeds the second weight measure; and

wherein (i) a weighted summation, of the set of weighted summations, for the candidate search result comprises a weighted combination of at least one weighted session-agnostic autocomplete score of the weighted set of session-agnostic autocomplete scores and at least one weighted session-aware autocomplete score of the weighted set of session-aware autocomplete scores, and (ii) a weight of the weighted combination is based at least in part on a presence of the candidate search result within the individual curated search corpus or the general search result corpus;

generating a set of hybrid autocomplete scores for the set of candidate search results based at least in part on the set of weighted summations between the first subset of the set of session-agnostic autocomplete scores, the second subset of the set of session-agnostic autocomplete scores, and the set of session-aware autocomplete scores, wherein the set of weighted summations is based at least in part on one or more locations of a candidate search result of the set of candidate search results, and the one or more locations comprise the individual curated search corpus or the general search result corpus;

generating a ranked autocomplete prediction based at least in part on the set of hybrid autocomplete scores; and

initiating the performance of one or more prediction-based actions based at least in part on the ranked autocomplete prediction.

11 . The system of claim 10 , wherein generating a session-aware autocomplete score of the set of session-aware autocomplete scores for the candidate search result of the set of candidate search results comprises:

identifying a search result cluster for the candidate search result;

determining that the search result cluster is in a qualifying search result cluster set for the search query prefix, wherein the qualifying search result cluster set comprises each search result cluster of a set of search result clusters that is generated by performing one or more two-means clustering operations on fixed-size search result representations for the set of candidate search results in a candidate search result corpus;

in response to determining that the search result cluster is in the qualifying search result cluster, generating, using a per-cluster matching machine learning model for the search result cluster, a per-cluster match result indicator for the search result cluster, and

in response to determining that the per-cluster match result indicator for the search result cluster is an affirmative per-cluster match result indicator:

(a) generating, using a cross-cluster ranking machine learning model, a qualifying result ranking score for the candidate search result, and

(b) generating the session-aware autocomplete score for the candidate search result based at least in part on the qualifying result ranking score.

12 . The system of claim 11 , wherein the qualifying search result cluster set comprises each search result cluster that: (i) corresponds to a leaf node of a height-fixed candidate search result corpus trie data object, and (ii) corresponds to the search query prefix.

13 . The system of claim 10 , wherein the individual curated search corpus comprises: (i) one or more visited provider designators for a query-generating user profile associated with the search query prefix, and (ii) for each visited provider designator, one or more related provider designators.

14 . The system of claim 10 , wherein the individual curated search corpus comprises: (i) one or more visited provider designators for a query-generating user profile associated with the search query prefix, and (ii) for each visited provider designator, one or more qualified related provider designators that satisfy one or more provider qualification criteria.

15 . The system of claim 14 , wherein the one or more provider qualification criteria comprise a location criterion characterized by a location feature for the query-generating user profile associated with the search query prefix.

16 . The system of claim 10 , wherein the set of weighted summations is based at least in part on a trie-based frequency score weight measure and an edit distance weight measure.

17 . The system of claim 16 , wherein the edit distance weight measure exceeds the trie-based frequency score weight measure.

18 . One or more non-transitory computer-readable storage media including instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

receiving a search query prefix; generating a set of session-agnostic autocomplete scores for a set of candidate search results by:

generating a first subset of the set of session-agnostic autocomplete scores for a first subset of the set of candidate search results within an individual curated search corpus based at least in part on an edit distance measure between the search query prefix and each of the first subset of the set of candidate search results, and

generating a second subset of the set of session-agnostic autocomplete scores for a second subset of the set of candidate search results within a general search result corpus based at least in part on a trie-based frequency score that is generated based at least in part on one or more qualifying trie leaf node subsets of a general search result corpus trie data object for the general search result corpus and a general corpus historical frequency score for each of the second subset of the set of candidate search results;

generating a set of session-aware autocomplete scores for the set of candidate search results;

generating (i) a weighted set of session-agnostic autocomplete scores by applying a first weight measure to the set of session-agnostic autocomplete scores and (ii) a weighted set of session-aware autocomplete scores by applying a second weight measure to the set of session-aware autocomplete scores, wherein the first weight measure exceeds the second weight measure; and

wherein (i) a weighted summation, of the set of weighted summations, for the candidate search result comprises a weighted combination of at least one weighted session-agnostic autocomplete score of the weighted set of session-agnostic autocomplete scores and at least one weighted session-aware autocomplete score of the weighted set of session-aware autocomplete scores, and (ii) a weight of the weighted combination is based at least in part on a presence of the candidate search result within the individual curated search corpus or the general search result corpus;

generating a set of hybrid autocomplete scores for the set of candidate search results based at least in part on the set of weighted summations between the first subset of the set of session-agnostic autocomplete scores, the second subset of the set of session-agnostic autocomplete scores, and the set of session-aware autocomplete scores, wherein the set of weighted summations is based at least in part on one or more locations of a candidate search result of the set of candidate search results, and the one or more locations comprise the individual curated search corpus or the general search result corpus;

generating a ranked autocomplete prediction based at least in part on the set of hybrid autocomplete scores; and

initiating the performance of one or more prediction-based actions based at least in part on the ranked autocomplete prediction.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 23, 2022
From: HAMILTON, LAURA D.; TOMAR, AYUSH; GARG, VINIT; YU, LUN
To: OPTUM, INC.
Reel/Frame 061193/0200 →
Continuity (1)
Related Publication 20240104091A1 · Mar 28, 2024
References Cited (220)
US 6182068B1 · Culliss · 2001 [cited by applicant]
US 6564213B1 · Ortega et al. · 2003 [cited by applicant]
US 6738754B1 · Norman, Jr. · 2004 [cited by applicant]
US 7657522B1 · Puzicha et al. · 2010 [cited by applicant]
US 7933859B1 · Puzicha et al. · 2011 [cited by applicant]
US 8100829B2 · Rothman et al. · 2012 [cited by applicant]
US 8312138B2 · Hull et al. · 2012 [cited by applicant]
US 8392207B2 · Olaniyan · 2013 [cited by applicant]
US 8403847B2 · Rothman et al. · 2013 [cited by applicant]
US 8583450B2 · Baker et al. · 2013 [cited by applicant]
US 8620842B1 · Cormack · 2013 [cited by applicant]
US 8706530B2 · Ohnemus et al. · 2014 [cited by applicant]
US 8793252B2 · Subasic et al. · 2014 [cited by applicant]
US 8972397B2 · Imig et al. · 2015 [cited by applicant]
US 8996314B2 · Ohnemus et al. · 2015 [cited by applicant]
US 9058327B1 · Lehrman et al. · 2015 [cited by applicant]
US 9424532B1 · Abedini et al. · 2016 [cited by applicant]
US 9436760B1 · Tacchi et al. · 2016 [cited by applicant]
US 9460214B2 · Vuong et al. · 2016 [cited by applicant]
US 9471709B1 · Zinenko et al. · 2016 [cited by applicant]
US 9977866B2 · Norris et al. · 2018 [cited by applicant]
US 10026114B2 · Tolvanen et al. · 2018 [cited by applicant]
US 10062039B1 · Lockett · 2018 [cited by applicant]
US 10176541B2 · Chaudhri et al. · 2019 [cited by applicant]
US 10262384B1 · Albro et al. · 2019 [cited by applicant]
US 10394894B2 · Garg et al. · 2019 [cited by applicant]
US 10409874B2 · Cheng · 2019 [cited by applicant]
US 10413779B2 · Ingram et al. · 2019 [cited by applicant]
US 10438291B1 · Neben et al. · 2019 [cited by applicant]
US 10489440B2 · Sharma et al. · 2019 [cited by applicant]
US 10770184B1 · Mcnair · 2020 [cited by applicant]
US 10789309B1 · Bousquet et al. · 2020 [cited by applicant]
US 10943072B1 · Jaganmohan · 2021 [cited by applicant]
US 10943178B1 · Gao et al. · 2021 [cited by applicant]
US 10977254B2 · Claussenelias et al. · 2021 [cited by applicant]
US 11004135B1 · Sandler et al. · 2021 [cited by applicant]
US 11055324B1 · Inoue et al. · 2021 [cited by applicant]
US 11238113B2 · Freese et al. · 2022 [cited by applicant]
US 11276089B1 · Salehie et al. · 2022 [cited by applicant]
US 11366966B1 · Ramsey et al. · 2022 [cited by applicant]
US 11416535B2 · Counts et al. · 2022 [cited by applicant]
US 11636949B2 · Goldberg et al. · 2023 [cited by applicant]
US 11748413B1 · Yoon et al. · 2023 [cited by applicant]
US 11775989B1 · Hao et al. · 2023 [cited by applicant]
US 12080398B2 · Nida et al. · 2024 [cited by applicant]
US 20020103680A1 · Newman · 2002 [cited by applicant]
US 20030163349A1 · Ho · 2003 [cited by applicant]
US 20040019601A1 · Gates · 2004 [cited by applicant]
US 20040073538A1 · Leishman et al. · 2004 [cited by applicant]
US 20050060194A1 · Brown · 2005 [cited by applicant]
US 20050075931A1 · Pearson · 2005 [cited by applicant]
US 20050080786A1 · Fish et al. · 2005 [cited by applicant]
US 20050165627A1 · Fotsch et al. · 2005 [cited by applicant]
US 20060206264A1 · Rasmussen · 2006 [cited by applicant]
US 20080133272A1 · Marshall · 2008 [cited by applicant]
US 20090132573A1 · Reed, Jr. et al. · 2009 [cited by applicant]
US 20090254402A1 · Beall · 2009 [cited by applicant]
US 20090281719A1 · Jakobson · 2009 [cited by applicant]
US 20090292555A1 · Brown · 2009 [cited by applicant]
US 20100063846A1 · Shakamuri · 2010 [cited by applicant]
US 20100076786A1 · Dalton et al. · 2010 [cited by applicant]
US 20100131482A1 · Linthicum et al. · 2010 [cited by applicant]
US 20100131498A1 · Linthicum et al. · 2010 [cited by applicant]
US 20100179839A1 · Collins et al. · 2010 [cited by applicant]
US 20110077973A1 · Breitenstein et al. · 2011 [cited by applicant]
US 20110161110A1 · Mault · 2011 [cited by applicant]
US 20110264513A1 · Ratnaparkhi · 2011 [cited by applicant]
US 20120089413A1 · Balassanian · 2012 [cited by applicant]
US 20120296455A1 · Ohnemus et al. · 2012 [cited by applicant]
US 20130024474A1 · Kraft et al. · 2013 [cited by applicant]
US 20130073686A1 · Sandholm · 2013 [cited by applicant]
US 20130211858A1 · Ohnemus et al. · 2013 [cited by applicant]
US 20130232006A1 · Holcomb et al. · 2013 [cited by applicant]
US 20140067423A1 · Joao · 2014 [cited by applicant]
US 20140088986A1 · Gowdy et al. · 2014 [cited by applicant]
US 20140100860A1 · Stollmeyer et al. · 2014 [cited by applicant]
US 20140129493A1 · Leopold · 2014 [cited by applicant]
US 20140156308A1 · Ohnemus et al. · 2014 [cited by applicant]
US 20140280289A1 · Marantz et al. · 2014 [cited by applicant]
US 20140310013A1 · Ram et al. · 2014 [cited by applicant]
US 20140316811A1 · Ohnemus et al. · 2014 [cited by applicant]
US 20140372133A1 · Austrum et al. · 2014 [cited by applicant]
US 20150234987A1 · Laing et al. · 2015 [cited by applicant]
US 20150331878A1 · Joseph · 2015 [cited by examiner]
US 20160048646A1 · Stover et al. · 2016 [cited by applicant]
US 20160078101A1 · Somaiya · 2016 [cited by examiner]
US 20160085799A1 · Kim et al. · 2016 [cited by applicant]
US 20160092598A1 · Mishra · 2016 [cited by examiner]
US 20160110826A1 · Morimoto et al. · 2016 [cited by applicant]
US 20160140125A1 · Goyal et al. · 2016 [cited by applicant]
US 20160188619A1 · Su et al. · 2016 [cited by applicant]
US 20170109355A1 · Li et al. · 2017 [cited by applicant]
US 20170123618A1 · Porcella · 2017 [cited by applicant]
US 20170249713A1 · Serbinis et al. · 2017 [cited by applicant]
US 20170270115A1 · Cormack et al. · 2017 [cited by applicant]
US 20170293923A1 · Margolis et al. · 2017 [cited by applicant]
US 20170308583A1 · Husain et al. · 2017 [cited by applicant]
US 20180025334A1 · Pourfallah et al. · 2018 [cited by applicant]
US 20180082030A1 · Allen et al. · 2018 [cited by applicant]
US 20180165288A1 · Chang et al. · 2018 [cited by applicant]
US 20180341875A1 · Carr · 2018 [cited by applicant]
US 20190005409A1 · Doshi et al. · 2019 [cited by applicant]
US 20190163679A1 · Srinivasa et al. · 2019 [cited by applicant]
US 20190171728A1 · Wakankar · 2019 [cited by examiner]
US 20190188251A1 · Liu et al. · 2019 [cited by applicant]
US 20190228038A1 · Mishra · 2019 [cited by applicant]
US 20190325031A1 · Puzicha · 2019 [cited by applicant]
US 20190347323A1 · Riesa et al. · 2019 [cited by applicant]
US 20200005149A1 · Ramanath et al. · 2020 [cited by applicant]
US 20200073953A1 · Kulkarni · 2020 [cited by examiner]
US 20200092695A1 · Vigeant et al. · 2020 [cited by applicant]
US 20200279641A1 · Nida et al. · 2020 [cited by applicant]
US 20200320139A1 · Duishoev et al. · 2020 [cited by applicant]
US 20200342010A1 · Rosomoff · 2020 [cited by applicant]
US 20200350072A1 · Mcewing et al. · 2020 [cited by applicant]
US 20200365259A1 · Chmait et al. · 2020 [cited by applicant]
US 20200388402A1 · Frey et al. · 2020 [cited by applicant]
US 20200411146A1 · Mcewing et al. · 2020 [cited by applicant]
US 20210019374A1 · Donaldson et al. · 2021 [cited by applicant]
US 20210027870A1 · West · 2021 [cited by applicant]
US 20210090694A1 · Colley et al. · 2021 [cited by applicant]
US 20210174164A1 · Hsieh · 2021 [cited by examiner]
US 20210209095A1 · Gallant · 2021 [cited by applicant]
US 20210241204A1 · Stein · 2021 [cited by applicant]
US 20210295822A1 · Tomkins et al. · 2021 [cited by applicant]
US 20210319520A1 · Winters · 2021 [cited by applicant]
US 20210357187A1 · Clement et al. · 2021 [cited by applicant]
US 20210398077A1 · Lomurray et al. · 2021 [cited by applicant]
US 20220005566A1 · Lyman et al. · 2022 [cited by applicant]
US 20220035867A1 · Tambi et al. · 2022 [cited by applicant]
US 20220035869A1 · Beck et al. · 2022 [cited by applicant]
US 20220067841A1 · Hanson · 2022 [cited by applicant]
US 20220198573A1 · Brown et al. · 2022 [cited by applicant]
US 20220384052A1 · Gnanasambandam et al. · 2022 [cited by applicant]
US 20220405476A1 · Sar et al. · 2022 [cited by applicant]
US 20220405590A1 · Hebets · 2022 [cited by applicant]
US 20230138014A1 · Bjrkqvist · 2023 [cited by applicant]
US 20230169139A1 · Baek et al. · 2023 [cited by applicant]
US 20230170092A1 · Moon et al. · 2023 [cited by applicant]
US 20230252338A1 · Ayyadevara et al. · 2023 [cited by applicant]
US 20230283987A1 · Cheng et al. · 2023 [cited by applicant]
US 20230289524A1 · Prasad et al. · 2023 [cited by applicant]
US 20230359441A1 · Duan et al. · 2023 [cited by applicant]
US 20230394040A1 · Gupta et al. · 2023 [cited by applicant]
US 20230409614A1 · Hamilton et al. · 2023 [cited by applicant]
US 20240054326A1 · Dave et al. · 2024 [cited by applicant]
US 20240248901A1 · Krishnan et al. · 2024 [cited by applicant]
US 20240265431A1 · Jimnez et al. · 2024 [cited by applicant]
US 20240386330A1 · Ajmera et al. · 2024 [cited by applicant]
CA 2816517A1 · 2012 [cited by applicant]
CA 2836381A1 · 2012 [cited by applicant]
CA 2841006A1 · 2013 [cited by applicant]
CN 103329135A · 2013 [cited by applicant]
CN 107665217A · 2018 [cited by applicant]
CN 108304439B · 2021 [cited by applicant]
EP 2622568A1 · 2013 [cited by applicant]
EP 2710503A1 · 2014 [cited by applicant]
EP 2729912A1 · 2014 [cited by applicant]
EP 3156949A2 · 2017 [cited by applicant]
IN 201941028487A · 2021 [cited by applicant]
WO 2012050969A1 · 2012 [cited by applicant]
WO 2012156374A1 · 2012 [cited by applicant]
WO 2013004706A1 · 2013 [cited by applicant]
WO 2014087252A2 · 2014 [cited by applicant]
“Clinical Management Guidelines for Obstetrician-Gynecologists”, The American College Of Obstetricians and Gynecologists Practice Bulletin, No. 109, Dec. 2009, pp. 1-12. [cited by applicant]
Chapelle, Olivier et al. “A Dynamic Bayesian Network Click Model For Web Search Ranking,” In Proceedings of the 18th International Conference On World Wide Web, Apr. 20, 2009, pp. 1-10, Madrid, Spain, available online a… [cited by applicant]
Galli, Keith. Galli K. “High-Performance Intent Classification In Sparse Supervised Data Conditions,” Doctoral Dissertation, Massachusetts Institute of Technology, Jun. 2019, (62 pages), available online: https://dspace… [cited by applicant]
Hwang, Sewoong et al. “Toward A Chatbot For Financial Sustainability,” Sustainability, vol. 13, No. 6:3173, Mar. 13, 2021, pp. 1-18, DOI: 10.3390/su13063173. [cited by applicant]
Li, Jianqiang et al. “Diversity-Aware Retrieval Of Medical Records,” Computers In Industry, vol. 29, pp. 81-91, May 2015, DOI: http://dx.doi.org/10.1016/j.compind.2014.09.004. [cited by applicant]
Miller, Alissa S. et al. “Improving Stage Of Change In An Employee Wellness Program,” Workplace Health & Safety, vol. 67, No. 8, pp. 381-290, Aug. 2019, DOI: 10.1177/2165079919838291. [cited by applicant]
Momma, Michinari et al. “Multi-Objective Relevance Ranking,” In Proceedings of the SIGIR 2019 eCom Workshop, Jul. 2019, (8 pages), Paris, France, DOI: https://assets.amazon.science/6f/7f/a34aac77415ead5d4d518d5b1801/mul… [cited by applicant]
Perrault, Evan K. et al. “Employees' Refusals To Participate In An Employer-Sponsored Wellness Program: Barriers and Benefits To Engagement,” Compensation & Benefits Review, vol. 52, No. 1, p. 8-18, Jan. 2020, DOI: 10.1… [cited by applicant]
Sun, Xu et al. “Feature-Frequency-Adaptive On-Line Training For Fast and Accurate Natural Language Processing,” Computational Linguistics, vol. 40, No. 3, pp. 563-586, Sep. 1, 2014, DOI: 10.1162/COLL_a_00193. [cited by applicant]
U.S. Provisional Patent Application, “Automated Health Data Acquisition, Processing and Communication System”, U.S. Appl. No. 61/732,203, Unpublished (filed Nov. 30, 2012), (Peter Ohnemus, Inventor), 98 pages, US. [cited by applicant]
U.S. Provisional Patent Application, “Health Data Acquisition, Processing and Communication System”, U.S. Appl. No. 61/387,906, Unpublished (filed Sep. 29, 2010), (Peter Ohnemus, Inventor), 31 pages, US. [cited by applicant]
U.S. Provisional Patent Application, “Health Data Acquisition, Processing and Communication System”, U.S. Appl. No. 61/495,247, Unpublished (filed Jun. 9, 2011), (Peter Ohnemus, Inventor), 50 pages, US. [cited by applicant]
U.S. Provisional Patent Application, “System And Method For Personal Energy Expenditure Analyses”, U.S. Appl. No. 61/486,658, Unpublished (filed May 16, 2011), (Peter Ohnemus, Inventor), 35 pages, US. [cited by applicant]
Wu, Qiang et al. “Adapting Boosting For Information Retrieval Measures,” Learning To Rank For Information Retrieval, vol. 13, pp. 254-270, Jun. 2010, DOI: https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.157.51… [cited by applicant]
Ahmad, Wasi Uddin et al. “Context Attentive Document Ranking and Query Suggestion,” In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 21-25, 2019, p… [cited by applicant]
Dao, Tien Tuan et al. “Knowledge-Based Personalized Search Engine For The Web-Based Human Musculoskeletal System Resources (HMSR) In Biomechanics,” Journal of Biomedical Informatics, vol. 46, pp. 160-173, Feb. 1, 2013, … [cited by applicant]
Gupta, Jai et al. “Personalized Online Spell Correction For Personal Search,” In Proceedings of the 2019 World Wide Web Conference (WWW'19), May 13-17, 2019, (7 pages), DOI: 10.1145/3308558.3313706. [cited by applicant]
McCreadie, Richard et al. “A Study of Personalised Medical Literature Search,” In International Conference of the Cross-Language Evaluation Forum for European Languages, Sep. 15, 2014, pp. 74-85, Springer, Cham, DOI: 10… [cited by applicant]
Yadav, Nishant et al. “Session Aware Query Auto Completion Using Extreme Multi-Label Ranking,” arXiv Preprint arXiv:2012.07654v2 [cs.IR], Jun. 7, 2021, (10 pages), available online: https://assets.amazon.science/5e/76/6… [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2023/015396, dated Jun. 19, 2023, (13 pages), European Patent Office, Rijswijk, Netherlands. [cited by applicant]
Lemoine, Julien, et al., “Predictive Search and Autocomplete”, Algolia Blog, (14 pages), Dec. 6, 2022, Retrieved from the Internet https://web.archive.org/web/20221206165729/https://www.algolia.com/blog/ai/predictive-se… [cited by applicant]
Non-Final Rejection Mailed on Jun. 20, 2024 for U.S. Appl. No. 18/314,441, 15 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Aug. 7, 2024 for U.S. Appl. No. 17/971,491, 7 page (s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Aug. 23, 2024 for U.S. Appl. No. 18/484,943, 14 page (s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Aug. 28, 2024 for U.S. Appl. No. 17/971,491, 2 page (s). [cited by applicant]
Bao, et al., “Medical Code Prediction via Capsule Networks and ICD Knowledge”, BMC Medical Informatics and Decision Making, vol. 21 (Suppl. 2):55, Jul. 30, 2021, (12 pages), doi.org/10.1186/s12911-021-01426-9. [cited by applicant]
Non-Final Rejection Mailed on Feb. 26, 2024 for U.S. Appl. No. 17/971,491, 11 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Dec. 5, 2024 for U.S. Appl. No. 18/314,441, 10 page (s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Nov. 14, 2024 for U.S. Appl. No. 17/971,491, 2 page (s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Oct. 18, 2024 for U.S. Appl. No. 18/416,276, 2 page (s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Oct. 24, 2024 for U.S. Appl. No. 17/971,491, 2 page (s). [cited by applicant]
Non-Final Rejection Mailed on Sep. 10, 2024 for U.S. Appl. No. 18/520,662, 17 page(s). [cited by applicant]
Non-Final Rejection Mailed on Sep. 20, 2024 for U.S. Appl. No. 18/047,209, 46 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Sep. 12, 2024 for U.S. Appl. No. 18/484,943, 4 page (s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Sep. 25, 2024 for U.S. Appl. No. 18/484,943, 4 page (s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Sep. 26, 2024 for U.S. Appl. No. 18/416,276, 10 page (s). [cited by applicant]
Corrected Notice of Allowance and Fees Due (PTOL-85), Sep. 12, 2024, U.S. Appl. No. 18/484,943, (4 pages). [cited by applicant]
NonFinal Office Action for U.S. Appl. No. 18/520,662, filed Sep. 10, 2024, (17 pages), U.S. Patent and Trademark Office, US. [cited by applicant]
Yan, et al., “A Survey of Automated International Classification of Diseases Coding: Development, Challenges, and Applications”, Intelligent Medicine, vol. 2, pp. 161-173, Mar. 11, 2022, https://doi.org/10.1016/j.imed.2… [cited by applicant]
Final Rejection Mailed on Mar. 17, 2025 for U.S. Appl. No. 18/520,662, 12 page(s). [cited by applicant]
Non-Final Rejection Mailed on Feb. 4, 2025 for U.S. Appl. No. 18/500,664, 40 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Feb. 26, 2025 for U.S. Appl. No. 18/314,441, 7 page (s). [cited by applicant]
Advisory Action (PTOL-303) Mailed on May 28, 2025 for U.S. Appl. No. 18/520,662, 3 page(s). [cited by applicant]
Final Rejection Mailed on Apr. 24, 2025 for U.S. Appl. No. 18/047,209, 50 page(s). [cited by applicant]
Gupta, Prabhakar , “A Context-Sensitive Real-Time Spell Checker with Language Adaptability”, IEEE, (Year: 2020), 7 pages. [cited by applicant]
Hienert, et al., “A Novel Combined Term Suggestion Service for Domain-Specific Digital Libraries”, 12 pages, (Year: 2011). [cited by applicant]
Jalali, et al., “The Effect of Using Domain Specific Ontologies in Query Expansion in Medical Field”, IEEE, (Year: 2008), 5 pages. [cited by applicant]
Non-Final Rejection Mailed on Jun. 16, 2025 for U.S. Appl. No. 18/520,662, 11 page(s). [cited by applicant]
Non-Final Rejection Mailed on Jun. 17, 2025 for U.S. Appl. No. 18/434,959, 15 page(s). [cited by applicant]
Non-Final Rejection Mailed on May 6, 2025 for U.S. Appl. No. 18/390,940, 11 page(s). [cited by applicant]
Non-Final Rejection Mailed on May 8, 2025 for U.S. Appl. No. 18/583,102, 18 page(s). [cited by applicant]
Soualmia, et al., The Effect of Using Domain Specific Ontologies in Query Expansion inBioinformatics, vol. 13, suppl. 14, (15 pages), 2012. [cited by applicant]
Final Rejection Mailed on Jul. 8, 2025 for U.S. Appl. No. 18/500,664, 21 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Aug. 8, 2025 for U.S. Appl. No. 18/980,819, 10 page(s). [cited by applicant]
Non-Final Rejection Mailed on Sep. 17, 2025 for U.S. Appl. No. 18/527,910, 21 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Sep. 30, 2025 for U.S. Appl. No. 18/390,940, 9 page(s). [cited by applicant]