| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dottirs (0) - 1 freq dothers (2) - 2 freq dottie's (3) - 6 freq thirs (3) - 1 freq dottir (3) - 1 freq bottles (3) - 1 freq dirs (3) - 2 freq potter's (4) - 1 freq davids (4) - 1 freq better (4) - 1 freq cottaries (4) - 1 freq doctors (4) - 33 freq doavirs (4) - 1 freq doos (4) - 3 freq mithers (4) - 5 freq dooters (4) - 2 freq cottar's (4) - 1 freq dowter's (4) - 1 freq dirlins (4) - 1 freq putins (4) - 1 freq dothers (4) - 5 freq dats (4) - 5 freq dotterie (4) - 1 freq pittin (4) - 1 freq lettin (4) - 1 freq |
dottirs (0) - 1 freq dothers (3) - 2 freq dirs (5) - 2 freq bottles (5) - 1 freq thirs (5) - 1 freq mithers (6) - 5 freq coulters (6) - 1 freq lyttles (6) - 1 freq beatties (6) - 1 freq dats (6) - 5 freq ithers (6) - 1 freq fitts (6) - 2 freq dottir (6) - 1 freq better (6) - 1 freq dottie's (6) - 6 freq puttin (7) - 1 freq lettirs (7) - 1 freq dother's (7) - 1 freq dotards (7) - 1 freq dottert (7) - 1 freq ditties (7) - 1 freq sottars (7) - 3 freq jotter's (7) - 1 freq weirs (7) - 1 freq torys (7) - 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 |
DOTTIRS |
| Time to execute Levenshtein function - 0.216885 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.414501 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.037872 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.051036 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.001150 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. |