| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| johnnygf (0) - 1 freq johnny (2) - 111 freq johnny's (2) - 5 freq johnnys (2) - 1 freq johnnyd (2) - 1 freq johnne (3) - 1 freq 'johnny (3) - 1 freq johnneh (3) - 6 freq johnnies (3) - 1 freq johnnydee (3) - 55 freq jobnny (3) - 1 freq jonny (3) - 5 freq joahnny (3) - 3 freq johnnie (3) - 28 freq john (4) - 802 freq janny's (4) - 2 freq jong (4) - 2 freq sonny (4) - 7 freq joyning (4) - 1 freq johne (4) - 1 freq bonny (4) - 496 freq onny (4) - 3 freq bonny's (4) - 1 freq johns (4) - 9 freq ronny (4) - 1 freq |
johnnygf (0) - 1 freq johnnyd (4) - 1 freq johnnys (4) - 1 freq johnny's (4) - 5 freq johnny (4) - 111 freq joahnny (5) - 3 freq johnnie (5) - 28 freq johnnydee (5) - 55 freq johnnies (5) - 1 freq johnneh (5) - 6 freq johnne (5) - 1 freq joining (6) - 10 freq johann (6) - 4 freq johonnie (6) - 1 freq johannine (6) - 1 freq johnegan (6) - 1 freq johanna (6) - 2 freq joyning (6) - 1 freq johannes (6) - 1 freq jonny (6) - 5 freq jobnny (6) - 1 freq 'johnny (6) - 1 freq johni (7) - 1 freq johnie (7) - 9 freq joahny (7) - 13 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 - JNKF johnnygf - 1 freq |
JOHNNYGF |
| Time to execute Levenshtein function - 0.177185 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.343038 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.027209 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.037107 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.000841 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. |