US 12,450,429 B2
Offline spellcheck candidates complementing runtime spellcheck
Adithya Rajan, Edison, NJ (US); Weiqi Tong, Brooklyn, NY (US); and Zheng Yan, Short Hills, NJ (US)
Assigned to WALMART APOLLO, LLC, Bentonville, AR (US)
Filed by Walmart Apollo, LLC, Bentonville, AR (US)
Filed on Jan. 30, 2023, as Appl. No. 18/103,195.
Prior Publication US 2024/0256768 A1, Aug. 1, 2024
Int. Cl. G06F 40/232 (2020.01); G06F 16/2455 (2019.01)
CPC G06F 40/232 (2020.01) [G06F 16/24552 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A system comprising:
one or more processors; and
one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to:
extract queries from historical search query data;
spellcheck each of the queries (i) using a first spellcheck model and (ii) using a second spellcheck model, wherein a latency of the first spellcheck model is lower than a latency of the second spellcheck model, and
wherein an overall accuracy of the second spellcheck model is higher than an overall accuracy of the first spellcheck model;
determine first queries of the queries in which, for each of the first queries, a first respective spellcheck output from the first spellcheck model is different from a second respective spellcheck output from the second spellcheck model; and
add at least a portion of the first queries to a spellcheck cache, for runtime spellchecking, that is configured to override the first spellcheck model and that maps the portion of the first queries to one or more corrections based at least in part on the second respective spellcheck output for the portion of the first queries.