| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doolally (0) - 11 freq doo-lally (1) - 1 freq 'doolally (1) - 1 freq donnelly (3) - 1 freq mortally (3) - 1 freq totally (3) - 117 freq door'll (3) - 4 freq locally (3) - 16 freq sosoally (3) - 1 freq coolly (3) - 2 freq woolly (3) - 9 freq goodall (3) - 1 freq dually (3) - 3 freq normally (3) - 56 freq dootfully (3) - 2 freq dooley (3) - 1 freq royally (3) - 2 freq orally (3) - 2 freq formally (3) - 7 freq dolly (3) - 109 freq fooball (3) - 1 freq morally (3) - 3 freq lally (3) - 2 freq florally (3) - 1 freq socially (3) - 15 freq |
doolally (0) - 11 freq doo-lally (2) - 1 freq 'doolally (2) - 1 freq dally (4) - 1 freq lally (4) - 2 freq dolly (4) - 109 freq dually (4) - 3 freq lolly (5) - 1 freq dalls (5) - 1 freq dilly (5) - 1 freq dalyell (5) - 6 freq devaall (5) - 1 freq dolled (5) - 6 freq dolls (5) - 11 freq dollt (5) - 1 freq dwall (5) - 10 freq droll (5) - 13 freq doll (5) - 40 freq ideally (5) - 2 freq dully (5) - 2 freq dollie (5) - 1 freq dollop (5) - 3 freq dollar (5) - 12 freq duanalla (5) - 1 freq socially (5) - 15 freq |
SoundEx code - D440 delilah - 2 freq 'doolally - 1 freq doolally - 11 freq dalyell - 6 freq doo-lally - 1 freq |
MetaPhone code - TLL delilah - 2 freq 'doolally - 1 freq doolally - 11 freq doo-lally - 1 freq |
DOOLALLY |
| Time to execute Levenshtein function - 0.200878 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.356584 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.027328 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.036451 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.000840 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. |