| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kbdnsehr (0) - 1 freq bender (4) - 5 freq danser (4) - 1 freq bunder (4) - 1 freq kidneys (4) - 6 freq kensho (4) - 1 freq binder (4) - 23 freq kinset (4) - 1 freq banger (4) - 5 freq unnser (4) - 8 freq kaiser (4) - 1 freq kjenner (4) - 1 freq spenser (4) - 1 freq deserr (4) - 1 freq 'unnser (4) - 2 freq insear (4) - 1 freq tenser (4) - 1 freq bunsen (4) - 28 freq aunser (4) - 2 freq kbaker (4) - 2 freq banker (4) - 12 freq kidder (4) - 4 freq bowser (4) - 4 freq toonser (4) - 7 freq bunter (4) - 8 freq |
kbdnsehr (0) - 1 freq denser (7) - 2 freq kidneys (7) - 6 freq kensho (7) - 1 freq danser (7) - 1 freq banesair (8) - 1 freq kindness (8) - 45 freq badness (8) - 12 freq kinship (8) - 4 freq banshee (8) - 15 freq bunchry (8) - 1 freq anser (8) - 5 freq ebner (8) - 5 freq keener (8) - 6 freq binner (8) - 2 freq kidney (8) - 10 freq unser (8) - 3 freq buncher (8) - 1 freq kosher (8) - 1 freq dunsh (8) - 1 freq benshees (8) - 2 freq btinher (8) - 1 freq banister (8) - 2 freq konshis (8) - 1 freq bonshaw (8) - 1 freq |
SoundEx code - K135 kaftan - 1 freq kipeet-nosed - 1 freq keepitna - 1 freq kipfatnh - 1 freq kbdnsehr - 1 freq |
MetaPhone code - KBTNSR kbdnsehr - 1 freq |
KBDNSEHR |
| Time to execute Levenshtein function - 0.223447 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.411375 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.027717 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.037692 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.000904 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. |