| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alfiehfc (0) - 1 freq alfie (3) - 28 freq alfieboe (3) - 1 freq alfie's (3) - 8 freq tljqvhfc (4) - 1 freq alright (4) - 21 freq alkie (4) - 3 freq almichty (4) - 40 freq liefe (4) - 1 freq calfie's (4) - 1 freq lief (4) - 3 freq alfred (4) - 12 freq calliemac (4) - 4 freq alien (4) - 41 freq laithfu (4) - 1 freq alie (4) - 1 freq calfies (4) - 4 freq afield (4) - 8 freq alec (4) - 112 freq alfiie's (4) - 1 freq alicht (4) - 14 freq liefu (4) - 1 freq calfie (4) - 8 freq awfie (4) - 392 freq falkirkfc (4) - 1 freq |
alfiehfc (0) - 1 freq lhfic (6) - 1 freq laithfu (6) - 1 freq alfresco (6) - 3 freq livifc (6) - 2 freq alfie's (6) - 8 freq alfieboe (6) - 1 freq alfie (6) - 28 freq offiece (7) - 3 freq alhce (7) - 1 freq alight (7) - 3 freq alfenus (7) - 1 freq nfyfc (7) - 1 freq affie (7) - 6 freq fief (7) - 1 freq clydefc (7) - 109 freq nffc (7) - 1 freq leithyface (7) - 1 freq lufc (7) - 2 freq pfhf (7) - 1 freq lff (7) - 1 freq zefhf (7) - 1 freq lfc (7) - 4 freq alichts (7) - 1 freq lithca (7) - 1 freq |
SoundEx code - A411 alphabet - 15 freq alphabetic - 2 freq alphabetti - 1 freq alphabee - 9 freq alphabets - 1 freq alphabetical - 2 freq albaparty - 9 freq alphabetties - 1 freq alfieboe - 1 freq albapartytime - 2 freq alfiehfc - 1 freq |
MetaPhone code - ALFFK alfiehfc - 1 freq |
ALFIEHFC |
| Time to execute Levenshtein function - 0.403814 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.523891 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.032126 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039632 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001060 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |