| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doubler (0) - 6 freq doublers (1) - 2 freq doobler (1) - 1 freq doubles (1) - 11 freq double (1) - 126 freq doubled (1) - 7 freq houler (2) - 1 freq couler (2) - 1 freq doublt (2) - 2 freq duller (2) - 2 freq doubted (2) - 7 freq dobber (2) - 4 freq ouler (2) - 8 freq dooble (2) - 26 freq doobled (2) - 4 freq dourer (2) - 2 freq cobler (2) - 1 freq dueler (2) - 1 freq doubters (2) - 2 freq 'double (2) - 3 freq doobles (2) - 2 freq doublin (2) - 6 freq bobbler (2) - 3 freq doublan (2) - 2 freq dourles (2) - 4 freq |
doubler (0) - 6 freq doobler (1) - 1 freq doubled (2) - 7 freq double (2) - 126 freq doublers (2) - 2 freq doubles (2) - 11 freq doobles (3) - 2 freq dueler (3) - 1 freq doublin (3) - 6 freq doubly (3) - 4 freq cobler (3) - 1 freq dooblet (3) - 2 freq doublan (3) - 2 freq doobled (3) - 4 freq duller (3) - 2 freq doublt (3) - 2 freq dooble (3) - 26 freq dobber (3) - 4 freq boiler (4) - 4 freq dazler (4) - 2 freq wobbler (4) - 1 freq doubil (4) - 3 freq dealer (4) - 15 freq dibber (4) - 2 freq dabber (4) - 3 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.245396 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.551371 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.036011 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.089578 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.000844 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. |