| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daneybash (0) - 1 freq tae-bash (3) - 1 freq deysh (4) - 4 freq handwash (4) - 1 freq dannycaz (4) - 2 freq ragabash (4) - 5 freq aneath (4) - 106 freq gatecrash (4) - 1 freq fanbase (4) - 1 freq danes (4) - 2 freq ganesh (4) - 6 freq daeneesh (4) - 1 freq wanease (4) - 1 freq danny's (4) - 7 freq danelaw (4) - 3 freq danish (4) - 19 freq database (4) - 25 freq anguish (5) - 5 freq danss (5) - 2 freq alabast (5) - 1 freq danielb (5) - 1 freq danssis (5) - 1 freq dangers (5) - 11 freq cannas (5) - 2 freq dansk (5) - 1 freq |
daneybash (0) - 1 freq danish (5) - 19 freq daeneesh (5) - 1 freq tae-bash (5) - 1 freq ganesh (6) - 6 freq dunsh (6) - 1 freq deysh (6) - 4 freq database (6) - 25 freq danes (6) - 2 freq ragabash (6) - 5 freq fanbase (6) - 1 freq dabs' (7) - 1 freq sneesh (7) - 5 freq debauch (7) - 1 freq dunbar (7) - 48 freq dans (7) - 3 freq dannsa (7) - 1 freq dinah (7) - 75 freq sneish (7) - 1 freq dunes (7) - 6 freq daubs (7) - 1 freq manish (7) - 4 freq nash (7) - 2 freq debs (7) - 1 freq doonpish (7) - 2 freq |
SoundEx code - D512 dumbs - 1 freq dumps - 14 freq dumbfuck - 1 freq dempster - 11 freq dunvegan - 2 freq dumpised - 4 freq dumpised-wye - 1 freq dumbstruck - 2 freq doun-fessit - 1 freq din-faced - 1 freq dumb's - 1 freq dempsey - 5 freq dumbies - 1 freq doonpish - 2 freq dumpish - 1 freq dddwymbcv - 1 freq dempz - 2 freq daneybash - 1 freq demobjob - 1 freq dunipace - 1 freq dhnfk - 1 freq |
MetaPhone code - TNBX daneybash - 1 freq |
DANEYBASH |
| Time to execute Levenshtein function - 0.231023 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.372374 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.034240 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.038687 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.000937 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. |