| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dumbfuck (0) - 1 freq dumbstruck (3) - 2 freq cumback (3) - 1 freq nubuck (3) - 1 freq fuck (4) - 529 freq bambrick (4) - 1 freq ‘fuck (4) - 1 freq “fuck (4) - 1 freq €œfuck (4) - 2 freq dumb (4) - 38 freq lubeck (4) - 2 freq dumbit (4) - 1 freq unstuck (4) - 1 freq dimmock (4) - 1 freq fuuuuck (4) - 1 freq €˜buck (4) - 1 freq dumbs (4) - 1 freq dumbwit (4) - 1 freq dulefu (4) - 3 freq €™fuck (4) - 1 freq publick (4) - 20 freq lumburt (4) - 1 freq decmbfjco (4) - 1 freq clbuck (4) - 1 freq smuck (4) - 1 freq |
dumbfuck (0) - 1 freq cumback (5) - 1 freq dmjack (6) - 1 freq dimmock (6) - 1 freq defeck (6) - 1 freq domjack (6) - 1 freq dumbstruck (6) - 2 freq bambrick (6) - 1 freq nubuck (6) - 1 freq kebbuck (7) - 5 freq amuck (7) - 1 freq dumstruik (7) - 1 freq dumba (7) - 1 freq subjeck (7) - 82 freq dumbies (7) - 1 freq drmmck (7) - 1 freq dumbo (7) - 2 freq dunnock (7) - 1 freq bruck (7) - 40 freq tarbuck (7) - 1 freq 'fuck (7) - 19 freq cumnock (7) - 35 freq draaback (7) - 2 freq €˜bruck (7) - 1 freq duck (7) - 60 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 - TMFK dumbfuck - 1 freq |
DUMBFUCK |
| Time to execute Levenshtein function - 0.258072 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.407195 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.027800 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.037535 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.000893 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. |