| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jonam (0) - 3 freq jonan (1) - 2 freq joram (1) - 2 freq jonas (1) - 2 freq jonah (1) - 30 freq jona (1) - 1 freq roam (2) - 9 freq joan (2) - 30 freq goram (2) - 1 freq jon's (2) - 1 freq donum (2) - 1 freq jooat (2) - 1 freq jong (2) - 2 freq monad (2) - 1 freq yona (2) - 12 freq joom (2) - 1 freq jonny (2) - 46 freq loam (2) - 5 freq jojum (2) - 1 freq jam (2) - 84 freq joni (2) - 3 freq oam (2) - 2 freq iona (2) - 125 freq jojom (2) - 1 freq koam (2) - 1 freq |
jonam (0) - 3 freq jonah (2) - 30 freq jonas (2) - 2 freq jona (2) - 1 freq joram (2) - 2 freq jonan (2) - 2 freq bonum (3) - 1 freq jonjo (3) - 3 freq jonik (3) - 2 freq joni (3) - 3 freq jorim (3) - 3 freq jojom (3) - 1 freq jorum (3) - 1 freq joinan (3) - 1 freq jon (3) - 4 freq jam (3) - 84 freq onm (3) - 1 freq jones (3) - 39 freq joana (3) - 1 freq jom (3) - 1 freq jonny (3) - 46 freq joom (3) - 1 freq joan (3) - 30 freq jojum (3) - 1 freq jong (3) - 2 freq |
SoundEx code - J550 jynin - 33 freq jinin - 8 freq j'mean - 1 freq jeynen - 1 freq jammen - 1 freq joinin - 7 freq jeanin - 1 freq jonan - 2 freq jonam - 3 freq joinan - 1 freq jinny-ann' - 1 freq jemima - 3 freq jammin - 4 freq johannine - 1 freq jynin' - 1 freq joinin' - 1 freq joeheenan - 7 freq jimnimmo - 1 freq jimmywim - 1 freq janeannie - 1 freq |
MetaPhone code - JNM jonam - 3 freq genome - 2 freq |
JONAM |
| Time to execute Levenshtein function - 0.299595 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.777404 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.075640 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.039543 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.000887 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. |