| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| potemkin (0) - 3 freq poemin (2) - 1 freq proteckin (2) - 2 freq pooerin (3) - 1 freq covemin (3) - 1 freq protectin (3) - 10 freq projeckin (3) - 1 freq protein (3) - 8 freq pokemon (3) - 1 freq pottin (3) - 1 freq peckin (3) - 16 freq ponkin (3) - 1 freq peakin (3) - 1 freq peekin (3) - 3 freq pokin (3) - 19 freq pooskin (3) - 1 freq protestin (3) - 2 freq pookin (3) - 1 freq steckin (3) - 1 freq powkin (3) - 24 freq stemmin (3) - 2 freq steikin (3) - 1 freq tempin (3) - 4 freq steekin (3) - 10 freq potterin (3) - 3 freq |
potemkin (0) - 3 freq proteckin (4) - 2 freq poemin (4) - 1 freq steikin (5) - 1 freq tempin (5) - 4 freq powkin (5) - 24 freq pookin (5) - 1 freq steekin (5) - 10 freq steckin (5) - 1 freq peteskii (5) - 1 freq pitman (5) - 1 freq poukin (5) - 2 freq efterkin (5) - 1 freq pooskin (5) - 1 freq potterin (5) - 3 freq stemmin (5) - 2 freq peckin (5) - 16 freq pokemon (5) - 1 freq ponkin (5) - 1 freq pottin (5) - 1 freq pokin (5) - 19 freq peekin (5) - 3 freq peakin (5) - 1 freq peteetion (6) - 3 freq tackin (6) - 1 freq |
SoundEx code - P352 patience - 46 freq putting - 17 freq 'patience - 1 freq potamus - 1 freq pautience - 1 freq photons - 2 freq pudding - 12 freq puddens - 7 freq peden's - 1 freq potions - 11 freq pittance - 5 freq puddins - 13 freq pithiness - 1 freq 'puttin-green - 1 freq pit-doons - 2 freq ptmsd - 1 freq pïttance - 1 freq pudden's - 1 freq 'puttanesca - 1 freq puttanesca - 9 freq puddeens - 1 freq pythons - 1 freq €œpatience - 1 freq patting - 2 freq pitting - 1 freq puddings - 1 freq potemkin - 3 freq podemos - 4 freq paddington - 2 freq patmcclay - 1 freq padding - 3 freq petanque - 1 freq ptncpxbq - 1 freq putinÂ’s - 1 freq ppthomson - 1 freq patmason - 1 freq patnsula - 2 freq |
MetaPhone code - PTMKN potemkin - 3 freq |
POTEMKIN |
| Time to execute Levenshtein function - 0.209060 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.389223 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.027937 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.038246 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.000960 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. |