| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| janephi (0) - 1 freq janet (3) - 1 freq janet's (3) - 3 freq jane (3) - 50 freq paulphi (3) - 1 freq jamph (3) - 1 freq janey (3) - 10 freq jane's (3) - 1 freq ganesh (3) - 6 freq jamphin (3) - 1 freq joseph (3) - 65 freq aneth (3) - 178 freq 'aneth (3) - 1 freq jannai (3) - 3 freq janet (3) - 75 freq janela (3) - 5 freq janet' (3) - 2 freq adelphi (3) - 1 freq gandhi (3) - 1 freq jamesca (4) - 1 freq an-oh (4) - 2 freq jacqui (4) - 1 freq ianthe (4) - 2 freq anet (4) - 1 freq onethin (4) - 2 freq |
janephi (0) - 1 freq joseph (4) - 65 freq jamph (4) - 1 freq janet' (5) - 2 freq jynuuh (5) - 1 freq janela (5) - 5 freq adelphi (5) - 1 freq gandhi (5) - 1 freq jonatha (5) - 1 freq jannai (5) - 3 freq jonah (5) - 30 freq jenth (5) - 1 freq janet (5) - 75 freq 'aneth (5) - 1 freq janey (5) - 10 freq jane (5) - 50 freq paulphi (5) - 1 freq jane's (5) - 1 freq ganesh (5) - 6 freq aneth (5) - 178 freq jamphin (5) - 1 freq alpha (6) - 5 freq jyne (6) - 116 freq jeep (6) - 4 freq jaune' (6) - 1 freq |
SoundEx code - J510 jump - 85 freq jumpy - 3 freq 'jump - 2 freq jamph - 1 freq jamb - 2 freq jamp - 34 freq jimp - 34 freq jumbo - 13 freq jumpe - 1 freq 'jump' - 2 freq jambo - 5 freq jimbo - 1 freq jnb - 1 freq jmwv - 1 freq jeanef - 3 freq janephi - 1 freq |
MetaPhone code - JNF geneva - 16 freq geneva' - 2 freq jeanef - 3 freq janephi - 1 freq |
JANEPHI |
| Time to execute Levenshtein function - 0.200234 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.364312 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.027390 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.038421 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.000894 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. |