Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dabblersdoric (0) - 1 freq dumbledore (6) - 22 freq dabbled (6) - 1 freq laberdonia (6) - 5 freq dashodoric (6) - 2 freq dabbers (6) - 1 freq labrador (7) - 7 freq aiberdein (7) - 3 freq napoleonic (7) - 4 freq caledonia (7) - 16 freq cabalistic (7) - 1 freq gabbled (7) - 1 freq cobblestones (7) - 1 freq yabbled (7) - 1 freq dabble (7) - 2 freq jabbered (7) - 1 freq tablespoon (7) - 3 freq aesopic (7) - 1 freq jabberin (7) - 1 freq dabberlack (7) - 1 freq aiberdonian (7) - 1 freq tablespoons (7) - 1 freq ashleystorrie (7) - 4 freq dailers (7) - 2 freq dawnleslie (7) - 14 freq |
dabblersdoric (0) - 1 freq dumbledore (10) - 22 freq dabbers (10) - 1 freq dabbled (10) - 1 freq dibbled (11) - 1 freq bairdric (11) - 3 freq doublers (11) - 2 freq dashodoric (11) - 2 freq babbled (12) - 2 freq weatherindoric (12) - 1 freq dibble-ennit (12) - 1 freq aberdour (12) - 9 freq dabbed (12) - 9 freq gamblers (12) - 4 freq ramblers (12) - 1 freq cobblestoned (12) - 2 freq habbers (12) - 1 freq dibber-dauberin (12) - 1 freq abbotsford (12) - 1 freq akbvsdogc (12) - 1 freq bleesterin (12) - 1 freq dabber (12) - 3 freq wabbles (12) - 1 freq aiberdour (12) - 5 freq labrador (12) - 7 freq |
SoundEx code - D146 devilry - 2 freq doublers - 2 freq deplore - 1 freq deplored - 1 freq deep-layered - 1 freq doubler - 6 freq double-ring - 1 freq divilry - 1 freq dabblersdoric - 1 freq devilwrstartan - 1 freq doobler - 1 freq |
MetaPhone code - TBLRSTRK dabblersdoric - 1 freq |
DABBLERSDORIC |
Time to execute Levenshtein function - 0.221447 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.411770 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.027931 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.038851 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.000880 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. |