| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dgjfgdqrj (0) - 5 freq cgogdqr (4) - 1 freq gjduj (5) - 1 freq dcjfql (5) - 1 freq egfdqt (5) - 1 freq jhgdra (5) - 1 freq yfrdjj (6) - 1 freq dhofar (6) - 1 freq khjfgcw (6) - 1 freq fmrj (6) - 1 freq grandur (6) - 1 freq grunders (6) - 2 freq fdrt (6) - 1 freq grigory (6) - 2 freq yghfdwt (6) - 1 freq dafter (6) - 6 freq dfr (6) - 2 freq wugqj (6) - 1 freq lggjxfgcj (6) - 1 freq darger (6) - 2 freq drudgery (6) - 3 freq deefurs (6) - 1 freq pymgpqrsj (6) - 1 freq diffuser (6) - 1 freq dsdur (6) - 1 freq |
dgjfgdqrj (0) - 5 freq cgogdqr (8) - 1 freq jhgdra (10) - 1 freq egfdqt (10) - 1 freq dcjfql (10) - 1 freq gjduj (10) - 1 freq dagger (11) - 4 freq dagidder (11) - 3 freq dagidder' (11) - 1 freq dgstandard (11) - 2 freq gardnerj (11) - 1 freq daggers (11) - 12 freq drjaydrno (11) - 2 freq gfeadjrd (11) - 1 freq dogger (11) - 1 freq defender (11) - 5 freq diggers (11) - 1 freq ungwdrj (11) - 1 freq diffugere (11) - 2 freq defenders (11) - 8 freq digger (11) - 12 freq jooder (12) - 1 freq gangers (12) - 2 freq deefer (12) - 1 freq dodgers (12) - 2 freq |
SoundEx code - D212 dispose - 2 freq disposable - 3 freq disposeetion - 3 freq disabuse - 2 freq dispossessed - 2 freq disaffection - 2 freq despise - 5 freq disposed - 2 freq despicable - 2 freq disposition - 2 freq dispositouns - 1 freq despisin - 1 freq dispez - 1 freq despised - 2 freq 'doggy-bug' - 1 freq doggie-bug - 1 freq disposal - 4 freq doughboys - 2 freq duck-face - 1 freq disobeys - 1 freq disposer - 1 freq disavous - 1 freq dispeace - 1 freq despising - 1 freq disfigurement - 1 freq disabused - 2 freq €˜dispose - 1 freq doughbaws - 2 freq disfigured - 1 freq dhsvgcq - 1 freq dsvgwb - 1 freq disaffected - 1 freq dzqbjp - 1 freq dcfcfrp - 1 freq dispassionate - 1 freq dukjbjx - 1 freq dgjfgdqrj - 5 freq dcjfql - 1 freq dzfzxq - 1 freq |
MetaPhone code - TKJFKTKR |
DGJFGDQRJ |
| Time to execute Levenshtein function - 0.246083 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.363835 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.027903 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.037291 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.000858 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. |