US 12,141,132 B1
Query refinements using search data
Matthias Heiler, Zurich (CH); Behshad Behzadi, Freienbach (CH); Evgeny A. Cherepanov, Adliswil (CH); Nils Grimsmo, Adliswil (CH); Aurélien Boffy, Basel (CH); Alessandro Agostini, Zurich (CH); Karoly Csalogany, Zurich (CH); Fredrik Bergenlid, Zurich (CH); and Marcin M. Nowak-Przygodzki, Zurich (CH)
Assigned to GOOGLE LLC, Mountain View, CA (US)
Filed by GOOGLE LLC, Mountain View, CA (US)
Filed on Nov. 28, 2022, as Appl. No. 18/070,261.
Application 18/070,261 is a continuation of application No. 16/889,166, filed on Jun. 1, 2020, granted, now 11,514,035.
Application 16/889,166 is a continuation of application No. 15/617,184, filed on Jun. 8, 2017, granted, now 10,691,680, issued on Jun. 23, 2020.
Application 15/617,184 is a continuation of application No. 14/813,237, filed on Jul. 30, 2015, granted, now 9,727,603, issued on Aug. 8, 2017.
Application 14/813,237 is a continuation of application No. 13/906,889, filed on May 31, 2013, granted, now 9,116,952, issued on Aug. 25, 2015.
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/242 (2019.01); G06F 16/23 (2019.01); G06F 16/2457 (2019.01); G06F 16/248 (2019.01); G06F 16/33 (2019.01); G06F 16/9032 (2019.01); G06F 16/9535 (2019.01)
CPC G06F 16/243 (2019.01) [G06F 16/23 (2019.01); G06F 16/2425 (2019.01); G06F 16/24575 (2019.01); G06F 16/248 (2019.01); G06F 16/3338 (2019.01); G06F 16/90328 (2019.01); G06F 16/9535 (2019.01)] 19 Claims
OG exemplary drawing
 
1. A system comprising one or more computers and one or more storage devices on which are stored instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
receiving, from a user device, a first query for a user session;
receiving, from the user device, a second query for the user session, the second query being different from the first query, and being subsequent to the first query in the user session without an intervening query;
determining, based on the first query and the second query, two or more query refinements;
selecting, based on scores associated with the two or more query refinements, a highest scored query refinement from the two or more query refinements, wherein selecting the highest scored query refinement is in response to determining that a highest score for the highest scored query refinement satisfies a threshold score;
providing, to the user device, first data for a first search result that is responsive to the highest scored query refinement; and
receiving, from the user device, user interface input indicating that the highest scored query refinement is incorrect.