Name-Search System and Method

• US 20120330947A1
• Filed: 06/22/2011
• Published: 12/27/2012
• Est. Priority Date: 06/22/2011
• Status: Active Grant

• Current Assignee: Jostle Corp.
• Original Assignee: Jostle Corp.
• Inventors: Palmer, Bradley James Francis, Huenemann, Geoffrey William, Humphrey, David Burton
• Granted Patent: US 8,706,723 B2
• Time in Patent Office: Days
• US Class Current: 707/728
• CPC Class Codes: G06F 16/24575 using context
• CPC Class Codes: G06F 16/9027 Trees
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A computer-implemented method is disclosed. The method may include receiving a portion of a personal name and converting the portion to a normalized portion by reducing the one or more characters to their simplest equivalents. The method may further include searching a typographical index tree and a phonetic index tree to identify one or more keys matching the normalized portion. The method may further include compiling, ranking, and presenting a plurality of suggested matches identified during the searching.

Claims

1. A computer-implemented method comprising:

receiving, from a user, a first portion of a personal name, the first portion comprising one or more characters;

converting the first portion to a first normalized portion by reducing the one or more characters to their simplest equivalents;

searching a main index to identify one or more first keys matching the first normalized portion;

searching a phonetic index to identify one or more second keys matching the first normalized portion;

compiling a first plurality of suggested matches, the first plurality of suggested matches comprising the union of indexed items corresponding to the one or more first keys and indexed items corresponding to the one or more second keys; and

presenting, to the user, at least of portion of the first plurality of suggested matches.

2. The method of claim 1, further comprising ranking the plurality of suggested matches according to a predicted relevance to the user.

3. The method of claim 2, further comprising permuting the first normalized portion to identify one or more typographical permutations thereof having a Damerau-Levenshtein distance of one.

4. The method of claim 3, further comprising searching both the main index and the phonetic index to identify one or more third keys matching the one or more typographical permutations.

5. The method of claim 4, wherein the plurality of suggested matches further comprises indexed items corresponding to the one or more third keys.

6. The method of claim 1, further comprising receiving, from the user, a second portion of the personal name, the second portion being adjacent to and received after the first portion, the second portion comprising one or more characters, the first and second portions collectively forming a first string of characters.

7. The method of claim 6, further comprising converting the first string to a first normalized string by reducing the one or more characters of the first string to their simplest equivalents.

8. The method of claim 7, further comprising searching the main index to identify one or more fourth keys matching the first normalized string.

9. The method of claim 8, further comprising searching the phonetic index to identify one or more fifth keys matching the first normalized string.

10. The method of claim 9, further comprising compiling a second plurality of suggested matches, the second plurality of suggested matches comprising the union of indexed items corresponding to the one or more fourth keys and indexed items corresponding to the one or more fifth keys.

11. The method of claim 10, further comprising presenting, to the user, at least of portion of the second plurality of suggested matches.

12. The method of claim 11, wherein the presenting of at least of portion of the first plurality of suggested matches occurs after the receiving of the first portion and before the receiving of the second portion.

13. The method of claim 12, wherein the presenting of at least of portion of the second plurality of suggested matches occurs after the receiving of the second portion.

14. A computer-implemented method comprising:

receiving, from a user, a portion of a personal name, the portion comprising three or more characters;

converting the portion to a normalized portion by reducing the three or more characters to their simplest equivalents;

permuting the normalized portion to identify one or more permutations thereof having a Damerau-Levenshtein distance of one;

searching a main index to identify one or more first keys matching the normalized portion or the one or more permutations;

searching a phonetic index to identify one or more second keys matching the normalized portion or the one or more permutations;

compiling a first plurality of suggested matches, the first plurality of suggested matches comprising the union of indexed items corresponding to the one or more first keys and indexed items corresponding to the one or more third keys; and

presenting, to the user, at least of portion of the first plurality of suggested matches.

15. The method of claim 14, further comprising receiving, from the user, a second portion of the personal name, the second portion being adjacent to and received after the first portion, the second portion comprising one or more characters, the first and second portions collectively forming a first string of characters.

16. The method of claim 15, further comprising converting the first string to a first normalized string by reducing the one or more characters of the first string to their simplest equivalents.

17. The method of claim 16, further comprising searching the main index to identify one or more third keys matching the first normalized string.

18. The method of claim 17, further comprising searching the phonetic index to identify one or more fourth keys matching the first normalized string.

19. The method of claim 18, further comprising compiling a second plurality of suggested matches, the second plurality of suggested matches comprising the union of indexed items corresponding to the one or more third keys and indexed items corresponding to the one or more fourth keys.

20. The method of claim 19, further comprising presenting, to the user, at least of portion of the second plurality of suggested matches.

21. A computer-implemented method comprising:

receiving, from a user, a first portion of a personal name, the first portion comprising one or more characters;

converting the first portion to a first normalized portion by reducing the one or more characters to their simplest equivalents;

searching a main index to identify one or more first keys matching the first normalized portion;

searching a phonetic index to identify one or more second keys matching the first normalized portion;

scoring typographically each of the one or more second keys;

identifying, via the scoring, a higher scoring portion of the one or more second keys;

compiling a first plurality of suggested matches, the first plurality of suggested matches comprising the union of indexed items correspond to the one or more first keys and indexed items corresponding to the higher scoring portion of the one or more second keys; and

presenting, to the user after the compiling, at least of portion of the first plurality of suggested matches.

22. A system for managing organizational data, the system comprising:

a processor; and

a memory coupled to the processor, the memory comprising computer-executable instructions that when executed by the processor perform operations including

receiving data from a first user defining a first organizational relationship

receiving data from a second user defining a second organizational relationship,

generating a set of organizational relationships wherein the set of organizational relationships includes the first organizational relationship and the second organizational relationship,

receiving, from a third user, a first portion of a personal name, the first portion comprising one or more characters,

converting the first portion to a first normalized portion by reducing the one or more characters to their simplest equivalents,

searching a main index to identify one or more first keys matching the first normalized portion,

searching a phonetic index to identify one or more second keys matching the first normalized portion,

compiling a first plurality of suggested matches, the first plurality of suggested matches comprising the union of indexed items corresponding to the one or more first keys and indexed items corresponding to the one or more second keys, and

presenting, to the user, at least of portion of the first plurality of suggested matches.