| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jameela (0) - 2 freq janela (2) - 5 freq jamesca (2) - 1 freq jamieca (2) - 3 freq pamela (2) - 1 freq jangelt (3) - 1 freq camels (3) - 4 freq jameson (3) - 2 freq hamely (3) - 45 freq fameeliar (3) - 19 freq rammel (3) - 1 freq janila (3) - 1 freq mela (3) - 3 freq james's (3) - 3 freq angela (3) - 46 freq camera (3) - 55 freq james (3) - 283 freq camel (3) - 7 freq hamelt (3) - 72 freq jamma (3) - 1 freq dumela (3) - 1 freq jeelt (3) - 16 freq amoeba (3) - 1 freq jamaica (3) - 24 freq eela (3) - 3 freq |
jameela (0) - 2 freq jamieca (3) - 3 freq pamela (3) - 1 freq janela (3) - 5 freq jamma (4) - 1 freq samuel (4) - 22 freq camel (4) - 7 freq dumela (4) - 1 freq james (4) - 283 freq meel (4) - 3 freq jame (4) - 3 freq jamaica (4) - 24 freq amelia (4) - 1 freq jamesie (4) - 2 freq mela (4) - 3 freq jamie (4) - 118 freq hamely (4) - 45 freq jamesca (4) - 1 freq jeel (4) - 7 freq namely (4) - 10 freq janila (4) - 1 freq jamesy (4) - 25 freq jeely (4) - 45 freq jamb (5) - 2 freq jmcl (5) - 21 freq |
SoundEx code - J540 jummle - 5 freq jameela - 2 freq jean'll - 1 freq jjconeill - 2 freq janela - 5 freq janila - 1 freq |
MetaPhone code - JML gemmle - 2 freq gemmule - 1 freq gemmel - 1 freq gemmely - 1 freq jummle - 5 freq jameela - 2 freq |
JAMEELA |
| Time to execute Levenshtein function - 0.287709 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.483501 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.033713 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.043613 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.000971 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. |