| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| october (0) - 88 freq oktober (1) - 2 freq octobers (1) - 1 freq outower (2) - 5 freq ootower (2) - 22 freq october's (2) - 1 freq oactobur (2) - 1 freq 'cover (3) - 1 freq onceover (3) - 1 freq toner (3) - 1 freq tooer (3) - 11 freq lochaber (3) - 5 freq ooer (3) - 17 freq scorer (3) - 3 freq otder (3) - 1 freq to'er (3) - 1 freq cooler (3) - 12 freq ooner (3) - 2 freq clobber (3) - 6 freq tower (3) - 46 freq docter (3) - 15 freq camber (3) - 1 freq doctor (3) - 245 freq clooer (3) - 2 freq tobar (3) - 2 freq |
october (0) - 88 freq oactobur (2) - 1 freq oktober (2) - 2 freq octobers (2) - 1 freq camber (4) - 1 freq tiber (4) - 1 freq tobar (4) - 2 freq cyber (4) - 4 freq comber (4) - 2 freq caber (4) - 4 freq actor (4) - 19 freq tuber (4) - 1 freq october's (4) - 1 freq ootower (4) - 22 freq outower (4) - 5 freq cooer (5) - 1 freq ooter (5) - 25 freq owther (5) - 5 freq doctour (5) - 13 freq cobra (5) - 5 freq scoter (5) - 1 freq other (5) - 579 freq closer (5) - 138 freq cobler (5) - 1 freq storer (5) - 1 freq |
SoundEx code - O231 osteopath - 3 freq osteopathy - 1 freq october - 88 freq octipises - 1 freq october's - 1 freq octavian's - 1 freq octopus - 3 freq ostoft - 1 freq octopussy - 1 freq oactobur - 1 freq octobers - 1 freq ozatbw - 1 freq oktober - 2 freq oejtfk - 1 freq |
MetaPhone code - OKTBR october - 88 freq oactobur - 1 freq oktober - 2 freq |
OCTOBER |
| Time to execute Levenshtein function - 0.247964 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.414331 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.036355 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.040373 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.000874 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. |