| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jundyin (0) - 3 freq lundin (2) - 1 freq pundin (2) - 1 freq fundin (2) - 62 freq judgin (2) - 17 freq jandin (2) - 1 freq undoin (2) - 1 freq jundie (2) - 3 freq auldyin (2) - 1 freq unduin (2) - 1 freq juidgin (2) - 3 freq undain (2) - 1 freq bluidyin (3) - 1 freq wondrin (3) - 1 freq bendin (3) - 15 freq jirdin (3) - 3 freq judgan (3) - 1 freq funding (3) - 5 freq juttin (3) - 3 freq hurryin (3) - 6 freq judean (3) - 1 freq junnerin (3) - 1 freq cuntin (3) - 1 freq soundin (3) - 10 freq juin (3) - 25 freq |
jundyin (0) - 3 freq jandin (2) - 1 freq jondeen (3) - 3 freq unduin (3) - 1 freq undain (3) - 1 freq jundie (3) - 3 freq undoin (3) - 1 freq pundin (3) - 1 freq lundin (3) - 1 freq fundin (3) - 62 freq myndin (4) - 19 freq boundin (4) - 7 freq jinin (4) - 8 freq jynerin (4) - 5 freq lendin (4) - 3 freq fandin (4) - 1 freq bunden (4) - 1 freq hondin (4) - 1 freq woundin (4) - 1 freq jauntin (4) - 1 freq pendin (4) - 3 freq jardin (4) - 2 freq windin (4) - 28 freq findin (4) - 71 freq poundin (4) - 12 freq |
SoundEx code - J535 jauntin - 1 freq jondeen - 3 freq jundyin - 3 freq jandin - 1 freq jonathan - 9 freq jonathan's - 1 freq jointing - 1 freq jamietinlin - 1 freq jonathancyborg - 1 freq jeanettenicl - 1 freq jonathanmeres - 2 freq johnnydundee - 3 freq johnmettham - 1 freq johnnyedmond - 2 freq |
MetaPhone code - JNTYN jundyin - 3 freq |
JUNDYIN |
| Time to execute Levenshtein function - 0.239862 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.360506 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.028499 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.037985 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.000908 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. |