| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kamerón (0) - 6 freq cameron (3) - 127 freq bayern (4) - 9 freq namer (4) - 1 freq caterin (4) - 4 freq amen (4) - 24 freq laneroon (4) - 1 freq merlin (4) - 6 freq samen (4) - 35 freq dammerin (4) - 1 freq camerons (4) - 1 freq yawmerin (4) - 1 freq merton (4) - 4 freq americy (4) - 1 freq gaerden (4) - 1 freq kamed (4) - 1 freq laern (4) - 13 freq amean (4) - 1 freq kern (4) - 3 freq 'amen (4) - 2 freq kervin (4) - 4 freq american (4) - 92 freq taperin (4) - 1 freq layerin (4) - 1 freq kames (4) - 7 freq |
kamerón (0) - 6 freq króna (5) - 1 freq cameron (6) - 127 freq kiverin (7) - 2 freq merran (7) - 4 freq almeron (7) - 1 freq smerten (7) - 1 freq mertin (7) - 2 freq samarkan (7) - 9 freq karn (7) - 7 freq gamergran (7) - 1 freq kertan (7) - 1 freq kairn (7) - 1 freq kieran (7) - 26 freq emmerson (7) - 1 freq bairÃn (7) - 1 freq kerven (7) - 1 freq karen (7) - 114 freq yammerin (7) - 7 freq kabrun (7) - 1 freq cameraman (7) - 2 freq kaitren (7) - 6 freq merrin (7) - 1 freq merkin (7) - 6 freq damorn (7) - 6 freq |
SoundEx code - K565 kamerón - 6 freq |
MetaPhone code - KMRN cameron - 127 freq €˜cameron - 1 freq kamerón - 6 freq |
KAMERÓN |
| Time to execute Levenshtein function - 0.239056 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.398607 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.032043 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.045112 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.000895 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. |