| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kebbuck (0) - 5 freq kebbock (1) - 2 freq kebbok (2) - 1 freq elbuck (2) - 13 freq clbuck (3) - 1 freq kebbers (3) - 1 freq debauch (3) - 1 freq cbbuk (3) - 1 freq nubuck (3) - 1 freq bruck (3) - 40 freq bbuk (3) - 1 freq elbuk (3) - 1 freq tarbuck (3) - 1 freq heubeck (3) - 1 freq keyburd (3) - 1 freq kermack (3) - 4 freq €˜buck (3) - 1 freq buck (3) - 31 freq elbucks (3) - 6 freq elbick (3) - 3 freq kessock (3) - 1 freq glenbuck (3) - 1 freq peyback (3) - 1 freq €˜bruck (3) - 1 freq klpuco (4) - 1 freq |
kebbuck (0) - 5 freq kebbock (1) - 2 freq kebbok (3) - 1 freq elbuck (4) - 13 freq kermack (5) - 4 freq heubeck (5) - 1 freq €˜buck (5) - 1 freq peyback (5) - 1 freq tarbuck (5) - 1 freq elbick (5) - 3 freq buck (5) - 31 freq kessock (5) - 1 freq cbbuk (5) - 1 freq kebbers (5) - 1 freq nubuck (5) - 1 freq clbuck (5) - 1 freq bruck (5) - 40 freq bbuk (5) - 1 freq publick (6) - 20 freq kick (6) - 122 freq andback (6) - 1 freq bbc (6) - 174 freq brick (6) - 50 freq 'beck (6) - 1 freq beck (6) - 32 freq |
SoundEx code - K120 keeps - 161 freq keep's - 3 freq kybosh - 3 freq kebbock - 2 freq kips - 3 freq keps - 6 freq kubis - 3 freq kebbuck - 5 freq kippage - 1 freq kebbok - 1 freq keb-hoose - 1 freq keep-hoose - 3 freq kfc - 5 freq ksvvkca - 1 freq kfcs - 1 freq kpj - 1 freq koyehhbiis - 1 freq kpju - 1 freq kibosh - 1 freq keeeeebzy - 2 freq kpxs - 1 freq kjjvsgo - 1 freq kbaek - 1 freq kps - 1 freq kjovoiz - 1 freq kyefis - 1 freq kbgc - 1 freq kbzjo - 1 freq |
MetaPhone code - KBK quebec - 3 freq cubic - 1 freq kebbock - 2 freq kebbuck - 5 freq 'gobbag - 1 freq kebbok - 1 freq gbwg - 1 freq cbbuk - 1 freq cbg - 1 freq kbaek - 1 freq |
KEBBUCK |
| Time to execute Levenshtein function - 0.193209 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.377687 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.027489 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.036923 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.000897 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. |