| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kayeadams (0) - 1 freq calendars (4) - 3 freq kanada (4) - 1 freq danadays (4) - 10 freq agendas (4) - 1 freq takeaways (4) - 4 freq ayeways (4) - 24 freq armadas (4) - 1 freq aareadies (4) - 39 freq addams (4) - 1 freq kyaaks (4) - 1 freq adams (4) - 9 freq kayakers (4) - 1 freq macadam (4) - 2 freq faeddans (4) - 1 freq areadies (4) - 2 freq canada's (4) - 1 freq raedan (5) - 1 freq readins (5) - 15 freq saems (5) - 1 freq ayewyes (5) - 9 freq haedan (5) - 3 freq kailas (5) - 1 freq barbados (5) - 6 freq paradigms (5) - 1 freq |
kayeadams (0) - 1 freq adams (5) - 9 freq addams (5) - 1 freq areadies (6) - 2 freq kayakers (6) - 1 freq kames (6) - 7 freq diadems (6) - 1 freq klyms (6) - 1 freq dams (6) - 6 freq kaims (6) - 2 freq akademy (6) - 3 freq kyaaks (6) - 1 freq aareadies (6) - 39 freq yoams (7) - 2 freq edam (7) - 45 freq 'adam (7) - 2 freq daads (7) - 1 freq exams (7) - 19 freq realms (7) - 6 freq cedars (7) - 1 freq dayes (7) - 1 freq daedalus (7) - 27 freq karam (7) - 1 freq kamara (7) - 1 freq madass (7) - 2 freq |
SoundEx code - K352 kidding - 8 freq kittens - 7 freq kitten's - 1 freq kith-ens - 1 freq keating - 1 freq kyittums - 1 freq kythins - 1 freq kidneys - 6 freq kayeadams - 1 freq kiddingaroundhq - 1 freq khwdmct - 1 freq kittenish - 1 freq kthomsonacademy - 4 freq |
MetaPhone code - KYTMS kyittums - 1 freq kayeadams - 1 freq |
KAYEADAMS |
| Time to execute Levenshtein function - 0.302485 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.523979 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.059271 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.038181 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.000880 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. |