CPC G06F 16/2468 (2019.01) [G06F 16/90348 (2019.01); G06F 17/18 (2013.01); G06F 18/22 (2023.01); G06F 40/109 (2020.01); G06F 40/166 (2020.01)] | 20 Claims |
1. A method operating on one or more processors comprising:
receiving a target from a remote computing device;
converting all capital letters in the target to their corresponding lower case letter;
collapsing all repeated letters in the target into a single letter;
removing all accents and punctuation from the target;
converting all geographical locations and corporation designations in the target into common terms;
determining a maximum length by adding a number of characters in the target as transformed with a search distance parameter;
determining a minimum length by subtracting the number of characters in the target as transformed with the search distance parameter;
forming a subset of a search list containing only search list members where a number of search list member characters is between the minimum length and the maximum length;
calculating a score of each subset member against the target as transformed using a Levenshtein distance algorithm; and
sending an indication of whether the target is located in the search list by determining if the score is above a threshold.
|