| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dolittle (0) - 1 freq dottle (2) - 1 freq domlittler (2) - 1 freq drittle (2) - 1 freq belittle (2) - 1 freq little (2) - 421 freq 'little (2) - 1 freq littie (3) - 1 freq cuittle (3) - 1 freq bottle (3) - 381 freq belittled (3) - 1 freq mittle (3) - 1 freq spittle (3) - 8 freq brittle (3) - 9 freq baittle (3) - 2 freq whittle (3) - 3 freq polite (3) - 56 freq swittle (3) - 2 freq politie (3) - 2 freq glittie (3) - 2 freq dottled (3) - 7 freq lhttle (3) - 1 freq smittle (3) - 3 freq ospittle (3) - 2 freq solitrie (3) - 1 freq |
dolittle (0) - 1 freq little (3) - 421 freq 'little (3) - 1 freq belittle (3) - 1 freq drittle (3) - 1 freq dottle (3) - 1 freq doititly (4) - 1 freq lyttle (4) - 2 freq domlittler (4) - 1 freq littler (5) - 1 freq eittle (5) - 1 freq politely (5) - 27 freq daveylittle (5) - 1 freq kittle (5) - 44 freq chittle (5) - 1 freq bittle (5) - 1 freq tottle (5) - 1 freq litrle (5) - 1 freq dottie (5) - 84 freq doolittlian (5) - 1 freq delitit (5) - 3 freq boattle (5) - 41 freq drittled (5) - 2 freq volatile (5) - 3 freq delite (5) - 4 freq |
SoundEx code - D434 dolittle - 1 freq deely-dally - 1 freq doolittlian - 1 freq dlittleglen - 1 freq |
MetaPhone code - TLTL telltale - 2 freq dolittle - 1 freq tell-tale - 2 freq deely-dally - 1 freq till-till - 1 freq tel-tail - 1 freq |
DOLITTLE |
| Time to execute Levenshtein function - 0.200423 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.399700 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.028777 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.039630 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.001110 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. |