| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| devtober (0) - 1 freq developer (3) - 3 freq destroyer (3) - 3 freq debtor (3) - 1 freq detoxed (3) - 1 freq devoored (3) - 1 freq leftover (3) - 1 freq deathbed (3) - 3 freq deter (3) - 4 freq dexter (3) - 4 freq leftower (3) - 3 freq detour (3) - 7 freq devour (3) - 7 freq oktober (3) - 2 freq october (3) - 88 freq dezember (3) - 4 freq devoir (3) - 1 freq devoted (3) - 4 freq devored (3) - 1 freq december (3) - 56 freq devoorin (4) - 2 freq dewtie (4) - 8 freq bedcover (4) - 1 freq ootower (4) - 22 freq to'er (4) - 1 freq |
devtober (0) - 1 freq october (5) - 88 freq devour (5) - 7 freq detour (5) - 7 freq dezember (5) - 4 freq devoir (5) - 1 freq december (5) - 56 freq devoted (5) - 4 freq dexter (5) - 4 freq oktober (5) - 2 freq developer (5) - 3 freq debtor (5) - 1 freq destroyer (5) - 3 freq deter (5) - 4 freq tiber (6) - 1 freq devout (6) - 4 freq dyvour (6) - 2 freq dither (6) - 2 freq tuber (6) - 1 freq dunter (6) - 2 freq docter (6) - 15 freq dizember (6) - 2 freq dafter (6) - 6 freq november (6) - 86 freq devotin (6) - 1 freq |
SoundEx code - D131 dib-dabs - 1 freq debt-free - 1 freq doubtfu - 3 freq doubtful - 4 freq doubtfully - 2 freq debatable - 1 freq debaitabil - 1 freq davidpsnp - 1 freq debdev - 1 freq davidbowie - 1 freq davidpreece - 1 freq devtober - 1 freq davidboatymcboa - 2 freq davidbu - 1 freq davidpaisley - 4 freq davidpwebb - 1 freq daviddavismp - 1 freq davidofficer - 1 freq davidfe - 6 freq davidpolson - 1 freq |
MetaPhone code - TFTBR devtober - 1 freq |
DEVTOBER |
| Time to execute Levenshtein function - 0.345244 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.545545 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.059208 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.039790 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.001093 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. |