Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
octobers (0) - 1 freq october's (1) - 1 freq october (1) - 88 freq oktober (2) - 2 freq doctors (3) - 33 freq outower (3) - 5 freq tubers (3) - 1 freq touers (3) - 4 freq octopus (3) - 3 freq actors (3) - 31 freq coopers (3) - 1 freq mcrobert (3) - 1 freq to'ers (3) - 2 freq scooders (3) - 1 freq uptober's (3) - 1 freq comers (3) - 2 freq others (3) - 59 freq sobers (3) - 1 freq clovers (3) - 2 freq oactobur (3) - 1 freq ooers (3) - 11 freq ootower (3) - 22 freq fochabers (3) - 11 freq otters (3) - 3 freq ectthers (3) - 1 freq |
octobers (0) - 1 freq october (2) - 88 freq october's (2) - 1 freq actors (4) - 31 freq oactobur (4) - 1 freq cabers (4) - 4 freq tubers (4) - 1 freq oktober (4) - 2 freq oxters (5) - 46 freq coosers (5) - 1 freq topers (5) - 1 freq covers (5) - 51 freq ectthers (5) - 1 freq tooers (5) - 6 freq clooers (5) - 1 freq cerberus (5) - 15 freq caterers (5) - 1 freq otters (5) - 3 freq towers (5) - 19 freq scooters (5) - 2 freq ootliers (5) - 1 freq doctours (5) - 2 freq owthers (5) - 1 freq to'ers (5) - 2 freq uptober's (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 - OKTBRS october's - 1 freq octobers - 1 freq |
OCTOBERS |
Time to execute Levenshtein function - 0.204953 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.406562 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.028495 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.040752 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.000859 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. |