| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| johnnyedmond (0) - 2 freq johnnyd (5) - 1 freq johnpdrummond (5) - 6 freq johnnydundee (5) - 3 freq johnnyrudkin (5) - 1 freq johnnydee (5) - 55 freq johnnyabdn (5) - 5 freq johnstone (6) - 35 freq bonnyton (6) - 18 freq johnston (6) - 19 freq johnegan (6) - 1 freq johnniewatson (6) - 1 freq johnnie (6) - 28 freq johnnies (6) - 1 freq johnmcd (6) - 2 freq johnne (6) - 1 freq jonnymain (6) - 4 freq johnnygf (6) - 1 freq pounced-on (6) - 1 freq redmond (6) - 2 freq johnny's (6) - 5 freq johnny (6) - 111 freq johnneh (6) - 6 freq monthedons (6) - 1 freq johndowson (6) - 3 freq |
johnnyedmond (0) - 2 freq johnnydundee (6) - 3 freq johnnyd (8) - 1 freq johnnydee (8) - 55 freq johnnyabdn (8) - 5 freq johnnyrudkin (8) - 1 freq johnpdrummond (8) - 6 freq johnmcd (9) - 2 freq johannsons (9) - 1 freq johncumming (9) - 1 freq jonnymain (9) - 4 freq journeyman (10) - 2 freq jonnybain (10) - 1 freq johnnys (10) - 1 freq johnston' (10) - 1 freq johnson (10) - 59 freq johnsons (10) - 1 freq hinnymoon (10) - 1 freq jneunedvnp (10) - 1 freq condemned (10) - 22 freq hinnerend (10) - 28 freq johndowson (10) - 3 freq hinner-end (10) - 3 freq johannine (10) - 1 freq johnnycakes (10) - 1 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 - JNYTMNT johnnyedmond - 2 freq |
JOHNNYEDMOND |
| Time to execute Levenshtein function - 0.471754 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.706360 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.028287 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.068727 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.000858 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. |