| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| octopus (0) - 3 freq octopussy (2) - 1 freq coops (3) - 1 freq doctours (3) - 2 freq cronus (3) - 1 freq october (3) - 88 freq crocus (3) - 5 freq octobers (3) - 1 freq doctour (3) - 13 freq chopes (3) - 1 freq campus (3) - 5 freq stop's (3) - 1 freq scotus (3) - 1 freq tops (3) - 21 freq ootput (3) - 2 freq crops (3) - 19 freq chops (3) - 17 freq cous (3) - 1 freq ocps (3) - 1 freq actoss (3) - 1 freq doctor's (3) - 18 freq actor's (3) - 1 freq olympus (3) - 14 freq oactobur (3) - 1 freq oops (3) - 18 freq |
octopus (0) - 3 freq octopussy (3) - 1 freq ocps (4) - 1 freq chops (4) - 17 freq crops (4) - 19 freq actoss (4) - 1 freq corpus (4) - 22 freq cops (4) - 3 freq actors (4) - 31 freq tops (4) - 21 freq ectos (4) - 1 freq stops (4) - 44 freq campus (4) - 5 freq chopes (4) - 1 freq coops (4) - 1 freq clips (5) - 9 freq toaps (5) - 2 freq octipises (5) - 1 freq cuppas (5) - 1 freq copies (5) - 41 freq coups (5) - 2 freq coits (5) - 1 freq co-ops (5) - 1 freq utopias (5) - 1 freq caips (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 - OKTPS octopus - 3 freq octopussy - 1 freq |
OCTOPUS |
| Time to execute Levenshtein function - 0.214510 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.369423 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.028321 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.037322 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.000872 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. |