US 11,755,126 B2
Method and system for dynamically processing ambiguous, reduced text search queries and highlighting results thereof
Sashikumar Venkataraman, Somerville, MA (US); Rakesh Barve, Bangalore (IN); Murali Aravamudan, Windham, NH (US); and Ajit Rajasekharan, West Windsor, NJ (US)
Assigned to Veveo, Inc., Andover, MA (US)
Filed by Veveo, Inc., Andover, MA (US)
Filed on Jan. 4, 2021, as Appl. No. 17/140,375.
Application 13/570,976 is a division of application No. 13/073,257, filed on Mar. 28, 2011, abandoned.
Application 17/140,375 is a continuation of application No. 13/570,976, filed on Aug. 9, 2012, granted, now 10,884,513.
Application 13/073,257 is a continuation of application No. 12/848,432, filed on Aug. 2, 2010, granted, now 7,937,394, issued on May 3, 2011.
Application 12/848,432 is a continuation of application No. 11/312,908, filed on Dec. 20, 2005, granted, now 7,779,011, issued on Aug. 17, 2010.
Claims priority of provisional application 60/716,101, filed on Sep. 12, 2005.
Claims priority of provisional application 60/711,866, filed on Aug. 26, 2005.
Prior Publication US 2021/0124428 A1, Apr. 29, 2021
Int. Cl. G06F 3/023 (2006.01); G06F 16/332 (2019.01)
CPC G06F 3/0237 (2013.01) [G06F 16/3322 (2019.01)] 23 Claims
OG exemplary drawing
 
1. A method for disambiguating an ambiguous search input of a plurality of unresolved keystrokes, the method comprising:
receiving the ambiguous search input of the plurality of unresolved keystrokes, wherein the ambiguous search input comprises a first set of the plurality of unresolved keystrokes, a second set of the plurality of unresolved keystrokes, and a resolved word separator that separates the first set of the plurality of unresolved keystrokes and the second set of the plurality of unresolved keystrokes;
identifying a plurality of potential search queries comprising one or more words based on the ambiguous search input of the plurality of unresolved keystrokes, wherein:
the plurality of potential search queries comprise a first potential search query comprising a first word and a second word;
the first word comprises a first set of characters that correspond to the first set of the plurality of unresolved keystrokes;
the second word comprises a second set of characters that correspond to the second set of the plurality of unresolved keystrokes; and
the first potential search query corresponds to a first content item, and each of the first word and the second word of the first potential search query correspond to a same first attribute of the first content item;
the plurality of potential search queries comprise a second potential search query comprising a third word and a fourth word;
the third word comprises a third set of characters that correspond to the first set of the plurality of unresolved keystrokes;
the fourth word comprises a fourth set of characters that correspond to the second set of the plurality of unresolved keystrokes;
the second potential search query corresponds to a second content item different from the first content item; and
the third word corresponds to the first attribute of the second content item, and the fourth word corresponds to a second attribute of the second content item different from the first attribute;
in response to identifying the plurality of potential search queries:
identifying a respective content type associated with each potential search query of the plurality of potential search queries,
determining a respective relevance value for each potential search query of the plurality of potential search queries based on the respective content types; and
ranking each potential search query of the plurality of potential search queries based on the respective relevance values; and
generating for display potential search queries, organized based on the ranking of each potential search query of the plurality of potential search queries.