| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| johnshaven (0) - 1 freq longhaven (3) - 2 freq johnnyabdn (4) - 5 freq johnegan (4) - 1 freq johnsmas (4) - 5 freq burnhaven (4) - 1 freq johnston (4) - 19 freq shaven (4) - 2 freq stonehaven (4) - 11 freq johnstone (4) - 35 freq johnson (4) - 59 freq joensen (4) - 3 freq johndowson (5) - 3 freq doun-fawen (5) - 1 freq joanstoon (5) - 1 freq johann (5) - 4 freq joinan (5) - 1 freq pooshen (5) - 1 freq kinshen (5) - 1 freq volkswagen (5) - 2 freq cohesive (5) - 9 freq conserve (5) - 2 freq doonhame (5) - 2 freq tax-haven (5) - 1 freq clean-shaven (5) - 2 freq |
johnshaven (0) - 1 freq johnson (6) - 59 freq johnston (6) - 19 freq johnstone (6) - 35 freq longhaven (6) - 2 freq johnsmas (7) - 5 freq johnswinney (7) - 9 freq johnnyabdn (7) - 5 freq joensen (7) - 3 freq burnhaven (7) - 1 freq shaven (7) - 2 freq johnegan (7) - 1 freq stonehaven (7) - 11 freq johnnie (8) - 28 freq hishan (8) - 1 freq sunsheen (8) - 6 freq johnsons (8) - 1 freq cjohnston (8) - 1 freq johnne (8) - 1 freq johnson's (8) - 5 freq moonshine (8) - 1 freq johnneh (8) - 6 freq johns (8) - 9 freq jonsavage (8) - 1 freq jensen (8) - 1 freq |
SoundEx code - J521 jing-bang - 15 freq jingbang - 7 freq jings-bings - 1 freq johnshaven - 1 freq junkball - 2 freq janiceforsyth - 25 freq jxngqf - 1 freq jmxfcgqexb - 1 freq joannakopaczyk - 22 freq jinny-spake - 1 freq johnnygf - 1 freq jimspencedundee - 37 freq jonsbaird - 5 freq jimspencesport - 25 freq jonsavage - 1 freq jamesbundy - 2 freq joanhaigbooks - 2 freq jnsgefukg - 1 freq jnxjkfnkw - 1 freq jamespearson - 3 freq jamesscfc - 1 freq janaagefjortoft - 1 freq jmzbfnwsth - 1 freq |
MetaPhone code - JNXFN johnshaven - 1 freq |
JOHNSHAVEN |
| Time to execute Levenshtein function - 0.368261 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.613485 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.028437 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.070169 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.000943 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. |