| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| klyms (0) - 1 freq weyms (2) - 2 freq clyes (2) - 6 freq lyes (2) - 1 freq clims (2) - 1 freq slums (2) - 8 freq key's (2) - 1 freq alms (2) - 2 freq lyme (2) - 1 freq klzmu (2) - 1 freq lym (2) - 1 freq flams (2) - 2 freq lymjs (2) - 1 freq elms (2) - 1 freq lums (2) - 34 freq lys (2) - 2 freq klegs (2) - 1 freq keys (2) - 63 freq lams (2) - 2 freq kay's (2) - 2 freq kles (2) - 2 freq glims (2) - 8 freq clams (2) - 1 freq kms (2) - 1 freq flys (2) - 4 freq |
klyms (0) - 1 freq klaus (3) - 243 freq slams (3) - 12 freq kless (3) - 1 freq lms (3) - 1 freq kms (3) - 1 freq glims (3) - 8 freq clams (3) - 1 freq klods (3) - 1 freq klaes (3) - 1 freq lims (3) - 2 freq klaas (3) - 1 freq kqms (3) - 1 freq kaims (3) - 2 freq kums (3) - 5 freq kles (3) - 2 freq sklims (3) - 1 freq plums (3) - 7 freq kloss (3) - 4 freq flams (3) - 2 freq clims (3) - 1 freq slums (3) - 8 freq alms (3) - 2 freq elms (3) - 1 freq lums (3) - 34 freq |
SoundEx code - K452 killing - 7 freq killins - 1 freq klankan - 1 freq killinchy - 3 freq killin-strang - 1 freq klyms - 1 freq kelng - 1 freq kilns - 1 freq killings - 2 freq kleenex - 3 freq klinsmann - 3 freq klinsmann's - 2 freq klinsman - 1 freq kilncadzow-kincadie - 1 freq klingons - 1 freq kalonji - 1 freq killingeve - 1 freq klines - 1 freq kilngranny - 1 freq |
MetaPhone code - KLMS calms - 2 freq callum's - 5 freq claims - 32 freq glamis - 6 freq climes - 6 freq clumsy - 10 freq qualms - 4 freq clims - 1 freq clams - 1 freq gleems - 1 freq gleams - 2 freq collums - 2 freq culmas - 2 freq colum's - 5 freq glims - 8 freq glooms - 2 freq klyms - 1 freq gloums - 1 freq gloams - 1 freq glaims - 1 freq climbs - 2 freq clim's - 1 freq columbus - 1 freq |
KLYMS |
| Time to execute Levenshtein function - 0.201150 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.355338 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.027872 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.039348 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.001311 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. |