Search query processing to identify related search terms and...

Data processing: database and file management or data structures – Database and file access – Record – file – and data search and comparisons

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07840577

ABSTRACT:
A search engine process predicts the correct spellings of search terms within multiple-term search queries. In one embodiment, when a user submits a multiple-term search query that includes a non-matching term and at least one matching term, a table is accessed to look up a set of terms that are “related” to the matching term or terms. A spelling comparison function is then used to determine whether any of these related terms is sufficiently similar in spelling to the non-matching term to be deemed a candidate correctly-spelled replacement. A candidate replacement term may automatically be substituted for the non-matching term, or may be suggested to the user as a replacement. The invention also includes a process for identifying terms that are related to each other based on the relatively high frequencies with which they co-occur in search queries of users, database records, and/or specific database fields.

REFERENCES:
patent: 4797855 (1989-01-01), Duncan, IV et al.
patent: 5218536 (1993-06-01), McWherter
patent: 5278980 (1994-01-01), Pedersen et al.
patent: 5297042 (1994-03-01), Morita
patent: 5467425 (1995-11-01), Lau et al.
patent: 5500920 (1996-03-01), Kupiec
patent: 5519608 (1996-05-01), Kupiec
patent: 5604897 (1997-02-01), Travis
patent: 5640553 (1997-06-01), Schultz
patent: 5659771 (1997-08-01), Golding
patent: 5675819 (1997-10-01), Schuetze
patent: 5694592 (1997-12-01), Driscoll
patent: 5696962 (1997-12-01), Kupiec
patent: 5737734 (1998-04-01), Schultz
patent: 5742180 (1998-04-01), DeHon et al.
patent: 5761689 (1998-06-01), Rayson et al.
patent: 5765180 (1998-06-01), Travis
patent: 5781904 (1998-07-01), Oren et al.
patent: 5794177 (1998-08-01), Carus et al.
patent: 5819251 (1998-10-01), Kremer et al.
patent: 5826261 (1998-10-01), Spencer
patent: 5875443 (1999-02-01), Nielsen
patent: 5920859 (1999-07-01), Li
patent: 5956739 (1999-09-01), Golding et al.
patent: 6006225 (1999-12-01), Bowman et al.
patent: 6018736 (2000-01-01), Gilai et al.
patent: 6131102 (2000-10-01), Potter
patent: 6137911 (2000-10-01), Zhilyaev
patent: 6144958 (2000-11-01), Ortega et al.
patent: 6169986 (2001-01-01), Bowman et al.
patent: 6401084 (2002-06-01), Ortega et al.
patent: 6421675 (2002-07-01), Ryan et al.
patent: 6424983 (2002-07-01), Schabes et al.
patent: 6772150 (2004-08-01), Whitman et al.
patent: 6853993 (2005-02-01), Ortega et al.
patent: 7424486 (2008-09-01), Whitman et al.
patent: 7444324 (2008-10-01), Ortega et al.
patent: 7617209 (2009-11-01), Whitman et al.
patent: 0439937 (1991-08-01), None
patent: 5314182 (1993-11-01), None
patent: 6314296 (1994-11-01), None
patent: WO 95/29451 (1995-11-01), None
patent: 9738376 (1997-10-01), None
Supplementary Search Report, dated Mar. 1, 2006 in counterpart application EP 99 93 5478 in four pages.
“Hierarchical File Organization and its Application to Similar-String Matching,” Ito and Kizawa, ACM Transactions on Database Systems (TODS), vol. 8, Issue 3, pp. 410-433 (Sep. 1983).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Search query processing to identify related search terms and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Search query processing to identify related search terms and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search query processing to identify related search terms and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4166854

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.