| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jameela (0) - 2 freq janela (2) - 5 freq jamieca (2) - 3 freq jamesca (2) - 1 freq pamela (2) - 1 freq hamelan (3) - 1 freq jammen (3) - 1 freq hamely (3) - 45 freq meeda (3) - 8 freq mandela (3) - 2 freq gardela (3) - 1 freq jameses (3) - 1 freq jamie (3) - 131 freq camel (3) - 7 freq samuel' (3) - 1 freq hameilt (3) - 1 freq ameest (3) - 1 freq meel (3) - 3 freq angela (3) - 46 freq daniela (3) - 2 freq aweel (3) - 4 freq jeelt (3) - 16 freq amelia (3) - 1 freq jameson (3) - 2 freq jangelt (3) - 1 freq |
jameela (0) - 2 freq jamieca (3) - 3 freq pamela (3) - 1 freq janela (3) - 5 freq jame (4) - 3 freq samuel (4) - 22 freq meel (4) - 3 freq jamaica (4) - 24 freq namely (4) - 10 freq dumela (4) - 1 freq janila (4) - 1 freq mela (4) - 3 freq amelia (4) - 1 freq jeely (4) - 46 freq jamie (4) - 131 freq james (4) - 283 freq hamely (4) - 45 freq jamma (4) - 1 freq jeel (4) - 7 freq jamesy (4) - 25 freq camel (4) - 7 freq jamesca (4) - 1 freq jamesie (4) - 2 freq jarl (5) - 36 freq jemima (5) - 3 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.198344 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.357169 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.028115 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.037406 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.001058 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. |