Method and apparatus for forming variant search strings

• US 6,459,810 B1
• Filed: 09/03/1999
• Issued: 10/01/2002
• Est. Priority Date: 09/03/1999
• Status: Expired due to Term

• Current Assignee: LinkedIn Corporation (Microsoft Corporation)
• Original Assignee: International Business Machines Corporation
• Inventors: Cring, Christopher T.
• Primary Examiner(s): Boudreau, Leo
• Assistant Examiner(s): Mariam, Daniel G.
• Application Number:
  US09/390,223
• Time in Patent Office: 1,124 Days
• Field of Search: 382/103, 382/159, 382/161, 382/173, 382/177, 382/181, 382/209, 382/219, 382/224, 382/225, 382/226, 382/229, 382/231, 382/305, 382/309, 382/176, 382/230, 382/310, 358/403, 358/404, 707/1-10
• US Class Current: 382/229
• CPC Class Codes: G06F 40/137 Hierarchical processing, e.g. outlines
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99936 Pattern matching access

Abstract

An exemplary embodiment of the invention is a method for forming variant search strings. The method includes receiving a search string and parsing the search string to locate a mistaken search string character. A mistaken search string character is a character which is confused with other characters. A variant search string is formed in response to a presence of a mistaken search string character in the search string. The search string and variant search string may then be used to search a database. Another exemplary embodiment of the invention is a system for forming variant search strings. The system includes a user interface for receiving a search string. A variant search string generator parses the search string to locate a mistaken search string character. The mistaken search string character is a character which is confused with other characters. The variant search string generator forms a variant search string in response to a presence of a mistaken search string character in the search string.

Claims

1. A method for forming variant search strings comprising:

defining at least one set of mistaken search string characters, each said set further comprising at least two mistaken search string characters;

receiving a search string;

parsing said search string to locate at least one of the mistaken search string characters defined in said set;

developing at least one variant search string for the located character, said developed variant search string including a substituted character in place of at least one said located character, said substituted character selected from said set; and

providing said search string and said variant search string to a search engine.

2. The method of claim 1 further comprising:

searching a database using said search string and said variant search string.

3. The method of claim 1 wherein:

said developing at least one variant search string includes forming a variant search string for every combination of located characters in said search string.

4. The method of claim 1 wherein:

said search string includes alphanumeric characters.

5. A system for forming variant search strings, the system comprising:

a memory string at least one set of mistaken search string characters, each said set further comprising at least two mistaken search string characters;

a user interface for receiving a search string;

a variant search string generator for parsing said search string to locate at least one of the mistaken search string characters defined in said set;

said variant search string generator developing at least one variant search string for the located character, said developed variant search string including a substituted character in place of at least one said located character, said substituted character selected from said set.

6. The system of claim 5 further comprising:

a database; and

a search engine for searching the database using said search string and said variant search string.

7. The system of claim 5, further comprises:

a computer program for developing at least one variant search string for every combination of located characters in said search string.

8. The system of claim 5 wherein:

said search string includes alphanumeric characters.

9. A storage medium encoded with machine-readable computer program code for forming variant search strings, the storage medium including instructions for causing a computer to implement a method comprising;

defining at least one set of mistaken search string characters, each said set further comprising at least two mistaken search string characters;

receiving a search string;

parsing said search string to locate at least one of the mistaken search string characters defined in said set;

developing at least one variant search string for the located character, said developed variant search string including a substituted character in place of at least one said located character, said substituted character selected from said set; and

providing said search string and said vacant search string search engine.

10. The storage medium of claim 9 further comprising instructions for causing a computer to implement:

searching a database using said search string and said variant search string.

11. The storage medium of claim 9 wherein:

said developing at least one variant search string includes forming a variant search string for every combination of located characters in said search string.

12. The storage medium of claim 9 wherein:

said search string includes alphanumeric characters.