| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jordan (0) - 52 freq gordan (1) - 1 freq joardan (1) - 8 freq jardin (2) - 2 freq norman (2) - 58 freq joda (2) - 3 freq jonan (2) - 2 freq dortan (2) - 1 freq jordy (2) - 4 freq boran (2) - 2 freq soddan (2) - 1 freq workan (2) - 9 freq foran (2) - 1 freq moran (2) - 8 freq herdan (2) - 1 freq borman (2) - 1 freq sortan (2) - 1 freq morgan (2) - 37 freq gorman (2) - 1 freq cordon (2) - 2 freq norlan (2) - 21 freq corda (2) - 1 freq dirdan (2) - 1 freq dornan (2) - 2 freq joram (2) - 2 freq |
jordan (0) - 52 freq joardan (1) - 8 freq gordan (2) - 1 freq jardin (2) - 2 freq jirdin (2) - 3 freq herdan (3) - 1 freq lurdan (3) - 1 freq wordin (3) - 3 freq cordon (3) - 2 freq jardine (3) - 29 freq dirdan (3) - 1 freq jerkan (3) - 1 freq gordin (3) - 2 freq jordy (3) - 4 freq gordon (3) - 123 freq moredun (4) - 1 freq arden (4) - 2 freq boarden (4) - 1 freq jerkin (4) - 2 freq dirdin (4) - 10 freq jurnai (4) - 1 freq pardon (4) - 31 freq hoordin (4) - 2 freq ordina (4) - 1 freq jandin (4) - 1 freq |
SoundEx code - J635 jordan - 52 freq joyriding - 1 freq jooratien - 1 freq joardan - 8 freq jardin - 2 freq jordanhill - 4 freq jirdin - 3 freq jkcorden - 2 freq jardine - 29 freq jordanogg - 1 freq jordangjack - 3 freq 'jordan's - 1 freq jrrtnbbedl - 1 freq jordanmccallion - 46 freq jordaneaston - 1 freq jordanhop - 3 freq jordansinclairr - 1 freq |
MetaPhone code - JRTN jordan - 52 freq jooratien - 1 freq joardan - 8 freq gerdin - 2 freq girdin - 2 freq gerdeen - 10 freq gyratin - 1 freq jardin - 2 freq gerden - 4 freq giordano - 1 freq jirdin - 3 freq gertin - 1 freq jardine - 29 freq |
JORDAN |
| Time to execute Levenshtein function - 0.180588 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.369372 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.028235 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.037887 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.000893 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. |