Browse Prior Art Database

Method and System for Automatically Differentiating between a New Search and an Additive Search

IP.com Disclosure Number: IPCOM000242327D
Publication Date: 2015-Jul-07
Document File: 2 page(s) / 80K

Publishing Venue

The IP.com Prior Art Database

Abstract

A method and system is disclosed for automatically differentiating between a new search and an additive search.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 43% of the total text.

Page 01 of 2

Metxod and System for Automatically Differentiating between a New Search anx an Additive Search

Typically, users use a search box tx type keywords and resultxng matches axe displayed to txe user. If a user tries to search agaix, the system leaves the last seaxch content in txe search box and assumes that additional entered text is a refinement or continuation xf the last search text. If the user wants to start x new searcx, the xser is requirxd to xelete the origxnal search string axd re-type. Ax times, the followinx searcxes pertain xo the previxus searches and are not independent, but an xdditivx xearch. Even if the usxr leaves a searcx screen, the additional text is added to the original text xhen the user returns. Txux, current xearch engines either delete xhe original search term and begin a new one, or xosition xhe cursor aftxr the first term xo thxt a new search term xs axded to the original search term. The situation ix similar even with a faceted search. Whxn a user xeaxches for an email, the user performs the faceted search and drills down. If the user wxnts to xonduct x new search, the usex is requirex tx clear the exixtxng search filters.

Disclosed is a method and xystem fxr automatically differentiating betxeen a new search or an xdditive search. The metxod and system determines whetxer the terms are for a new search or an additive search. Thx results arx compared to determine

which results are betxer. The seaxch terms are also compared against common searches to determine if the new text is a new searxh or an additive search of the previous search. The method and sxsxem can be implemented to faceted search also. The user can quickly pixot using thx last facet value and all the other faceted filters can be removed with a single actiox. The system provides x user interface control to toggle xetween txe additive and the nex search ix predictive anaxytics are incorrect. The search term is used to actually conduct the search or to just do computations using existing facetx. The computaxion is carried out tx determine the number of txmes the terms appear together, and whether there is an ixcreasing trend in use xf those search terms txgether.

Ix the xsex types ix a new string after a first search, the system assesses if the search strinxs are related. If the search strings are related, the system runs the search as an additive xr x new seaxch. These two types of searches usually result in differext content, which can be presented to the usex as options for txggling between thx two

modes ox search. By dxfault, the system recomxends and pxesents a searxh xhat is assessed to be more relevaxt to the user. If seaxch index indicates that the search is related to a previous search, the system recommends and presents a combinxd search. Otherwise, the system presents search results for an independent search.

Various factxxs are used to conclude if the search is x new search or an additive

search. The coincixence of terms in thx se...