| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dolts (0) - 2 freq dolt (1) - 1 freq bolts (1) - 12 freq dolls (1) - 11 freq dowts (1) - 4 freq colts (1) - 2 freq dots (1) - 8 freq douts (1) - 18 freq doles (1) - 1 freq volts (1) - 3 freq doots (1) - 35 freq dorts (1) - 8 freq docks (2) - 27 freq doubts (2) - 5 freq does (2) - 385 freq dusts (2) - 2 freq dort (2) - 2 freq ots (2) - 2 freq dost (2) - 39 freq yolt (2) - 1 freq motts (2) - 1 freq voits (2) - 2 freq boats (2) - 109 freq roles (2) - 12 freq adopts (2) - 1 freq |
dolts (0) - 2 freq dorts (2) - 8 freq doots (2) - 35 freq adults (2) - 49 freq idults (2) - 1 freq delyts (2) - 1 freq doles (2) - 1 freq volts (2) - 3 freq douts (2) - 18 freq dolls (2) - 11 freq bolts (2) - 12 freq dowts (2) - 4 freq colts (2) - 2 freq dolt (2) - 1 freq dots (2) - 8 freq dulls (3) - 1 freq melts (3) - 10 freq dolton (3) - 1 freq idols (3) - 4 freq halts (3) - 1 freq wilts (3) - 1 freq lots (3) - 80 freq loats (3) - 2 freq dalt (3) - 1 freq malts (3) - 3 freq |
SoundEx code - D432 delyts - 1 freq delytesum - 2 freq dialled's - 1 freq delytes - 1 freq dolts - 2 freq dollydigital - 13 freq deltcharlie - 1 freq dialadeck - 1 freq |
MetaPhone code - TLTS toilets - 32 freq telt's - 4 freq tilts - 9 freq delyts - 1 freq dialled's - 1 freq delytes - 1 freq dolts - 2 freq |
DOLTS |
| Time to execute Levenshtein function - 0.228331 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.402095 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.039802 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.052207 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.001142 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. |