Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
doubler (0) - 6 freq doubled (1) - 7 freq double (1) - 129 freq doublers (1) - 2 freq doubles (1) - 11 freq doobler (1) - 1 freq dourer (2) - 2 freq dooblet (2) - 2 freq ouler (2) - 8 freq doubly (2) - 4 freq doobled (2) - 4 freq cobbler (2) - 2 freq doubters (2) - 2 freq dourles (2) - 4 freq cobler (2) - 1 freq 'double (2) - 3 freq dueler (2) - 1 freq dobber (2) - 4 freq doobles (2) - 2 freq wobbler (2) - 1 freq doule (2) - 2 freq dooble (2) - 26 freq roubles (2) - 1 freq bobbler (2) - 3 freq doublin (2) - 6 freq |
doubler (0) - 6 freq doobler (1) - 1 freq doublers (2) - 2 freq doubles (2) - 11 freq double (2) - 129 freq doubled (2) - 7 freq doobles (3) - 2 freq dueler (3) - 1 freq dobber (3) - 4 freq doublan (3) - 2 freq doublt (3) - 2 freq duller (3) - 2 freq doublin (3) - 6 freq dooble (3) - 26 freq cobler (3) - 1 freq dooblet (3) - 2 freq doobled (3) - 4 freq doubly (3) - 4 freq dollar (4) - 12 freq dublin (4) - 29 freq dabber (4) - 3 freq doubted (4) - 7 freq boiler (4) - 4 freq doubil (4) - 3 freq dazler (4) - 2 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 - TBLR tubular - 2 freq doubler - 6 freq doobler - 1 freq |
DOUBLER |
Time to execute Levenshtein function - 0.187109 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.332943 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.027769 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.038048 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.000891 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. |