| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jordan (0) - 52 freq gordan (1) - 1 freq joardan (1) - 8 freq dortan (2) - 1 freq foran (2) - 1 freq cordon (2) - 2 freq borman (2) - 1 freq korean (2) - 8 freq dirdan (2) - 1 freq wordin (2) - 3 freq forgan (2) - 3 freq boran (2) - 2 freq dornan (2) - 2 freq organ (2) - 16 freq mornan (2) - 1 freq joram (2) - 2 freq dorian (2) - 2 freq norman (2) - 57 freq jardin (2) - 2 freq joukan (2) - 1 freq morgan (2) - 37 freq joan (2) - 30 freq forran (2) - 1 freq gordin (2) - 2 freq jonan (2) - 2 freq |
jordan (0) - 52 freq joardan (1) - 8 freq jardin (2) - 2 freq jirdin (2) - 3 freq gordan (2) - 1 freq gordin (3) - 2 freq jordy (3) - 4 freq gordon (3) - 123 freq herdan (3) - 1 freq lurdan (3) - 1 freq jerkan (3) - 1 freq jardine (3) - 29 freq cordon (3) - 2 freq dirdan (3) - 1 freq wordin (3) - 3 freq jandin (4) - 1 freq giordano (4) - 1 freq jarrin (4) - 2 freq journay (4) - 3 freq gerden (4) - 4 freq ridan (4) - 1 freq jurnay (4) - 6 freq mirdin (4) - 1 freq hirdin (4) - 4 freq dirdin (4) - 10 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.224912 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.385292 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.028137 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.038664 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.000818 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. |