Determining logically-related sub-strings of a string
US7747607B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Nov 2, 2006 |
| Grant date | Jun 29, 2010 |
| Priority date | — |
| Expiry date | Sep 19, 2027 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/3322
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques are provided for determining which sub-strings of a string are logically related to the string. In one embodiment, sub-strings of a string are considered logically related to the string if the sub-strings frequently appear as queries in the same sessions in which the string itself appears as a query. Information about strings and their logically-related sub-strings is stored in a “splits-dictionary”. Once generated, the splits-dictionary may be used by the search engine for a variety of purposes, including the suggestion of alternative queries. The splits-dictionary may also be used by the search engine for other purposes, such as to affect the ranking of search results.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.