| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dowters (0) - 1 freq dowter's (1) - 1 freq dooters (1) - 2 freq dowers (1) - 1 freq dowter (1) - 8 freq dusters (2) - 3 freq rowers (2) - 3 freq dowser (2) - 1 freq doacters (2) - 1 freq voters (2) - 63 freq posters (2) - 30 freq gowsters (2) - 1 freq dowper (2) - 4 freq footers (2) - 3 freq bowsters (2) - 2 freq dunters (2) - 6 freq potters (2) - 12 freq corters (2) - 1 freq dowts (2) - 4 freq dossers (2) - 3 freq gowfers (2) - 1 freq dodgers (2) - 2 freq oxters (2) - 46 freq mowers (2) - 1 freq dowier (2) - 1 freq |
dowters (0) - 1 freq dowter (2) - 8 freq dowers (2) - 1 freq dowter's (2) - 1 freq dooters (2) - 2 freq doctors (3) - 33 freq dunters (3) - 6 freq doubters (3) - 2 freq doacters (3) - 1 freq dusters (3) - 3 freq dowts (3) - 4 freq disters (3) - 1 freq porters (4) - 6 freq towers (4) - 19 freq lowers (4) - 7 freq doitert (4) - 1 freq powers (4) - 16 freq rowlers (4) - 3 freq hooters (4) - 3 freq dowless (4) - 2 freq dothers (4) - 5 freq dochters (4) - 51 freq doatery (4) - 1 freq dooners (4) - 2 freq loiters (4) - 1 freq |
SoundEx code - D362 dothers - 5 freq detergent - 1 freq dother's - 1 freq 'dae-it-yersel' - 1 freq dooters - 2 freq deodorise - 1 freq dowter's - 1 freq detract - 2 freq deid-ruckle - 1 freq detours - 1 freq dietrich - 2 freq dietrich's - 1 freq deid-thraws - 1 freq detrack - 1 freq detractors - 1 freq dowters - 1 freq dothers - 2 freq dhothersall - 2 freq dottirs - 1 freq |
MetaPhone code - TTRS daughters - 6 freq tutors - 6 freq dooters - 2 freq deodorise - 1 freq dowter's - 1 freq tutors' - 1 freq tedders - 1 freq tidder's - 2 freq tatters - 5 freq titters - 1 freq detours - 1 freq tudors - 2 freq tatars - 1 freq dowters - 1 freq tetris - 1 freq dottirs - 1 freq |
DOWTERS |
| Time to execute Levenshtein function - 0.344281 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.437673 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.030267 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.039450 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.000953 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. |