| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| potatoes (0) - 7 freq potties (2) - 1 freq tomatoes (2) - 6 freq potato (2) - 11 freq polaties (2) - 1 freq rotates (2) - 2 freq potlatches (3) - 1 freq polatie (3) - 1 freq potata (3) - 1 freq pot-holes (3) - 1 freq bottoms (3) - 6 freq petties (3) - 1 freq patois (3) - 18 freq plato's (3) - 2 freq portaloos (3) - 1 freq tomaties (3) - 1 freq palates (3) - 1 freq totties (3) - 8 freq potions (3) - 11 freq wottles (3) - 1 freq praties (3) - 2 freq potter (3) - 29 freq statues (3) - 7 freq oates (3) - 1 freq estates (3) - 19 freq |
potatoes (0) - 7 freq potties (2) - 1 freq potts (3) - 1 freq petties (3) - 1 freq rotates (3) - 2 freq polaties (3) - 1 freq patties (3) - 2 freq potato (3) - 11 freq plates (4) - 58 freq prataes (4) - 1 freq pottie (4) - 10 freq pilates (4) - 1 freq potted (4) - 4 freq photaes (4) - 9 freq pouties (4) - 1 freq pirates (4) - 7 freq poats (4) - 2 freq pitts (4) - 1 freq posties (4) - 3 freq states (4) - 79 freq estates (4) - 19 freq potters (4) - 12 freq potamus (4) - 1 freq totties (4) - 8 freq palates (4) - 1 freq |
SoundEx code - P332 pathetically - 2 freq pathetic - 28 freq potatoes - 7 freq pitheids - 1 freq €œpathetic - 1 freq potetaster - 1 freq |
MetaPhone code - PTTS potatoes - 7 freq |
POTATOES |
| Time to execute Levenshtein function - 0.180964 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.375487 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.028859 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.038788 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.000864 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. |