| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dothers (0) - 5 freq bothers (1) - 9 freq mothers (1) - 9 freq dother's (1) - 1 freq dother (1) - 37 freq nothers (1) - 1 freq others (1) - 59 freq anothers (2) - 1 freq other' (2) - 2 freq dockers (2) - 12 freq mother' (2) - 1 freq dodgers (2) - 2 freq nithers (2) - 1 freq dunthers (2) - 1 freq bothert (2) - 37 freq rothes (2) - 1 freq doukers (2) - 1 freq pouthers (2) - 1 freq brothers (2) - 44 freq bother (2) - 329 freq ithers (2) - 577 freq mathers (2) - 2 freq dochters (2) - 51 freq potters (2) - 12 freq dolders (2) - 1 freq |
dothers (0) - 5 freq nothers (2) - 1 freq dother (2) - 37 freq others (2) - 59 freq dother's (2) - 1 freq bothers (2) - 9 freq mothers (2) - 9 freq wathers (3) - 1 freq thers (3) - 1 freq bathers (3) - 2 freq fithers (3) - 4 freq eithers (3) - 1 freq tithers (3) - 1 freq lethers (3) - 1 freq fathers (3) - 3 freq gethers (3) - 11 freq dithery (3) - 1 freq dooters (3) - 2 freq gathers (3) - 3 freq uthers (3) - 1 freq mithers (3) - 80 freq mathers (3) - 2 freq dither (3) - 2 freq muthers (3) - 1 freq owthers (3) - 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 - T0RS dothers - 5 freq tither's - 1 freq dother's - 1 freq tithers - 1 freq dothers - 2 freq |
DOTHERS |
| Time to execute Levenshtein function - 0.219173 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.369383 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.027615 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.038535 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.000917 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. |