| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| potamus (0) - 1 freq potus (2) - 1 freq poames (2) - 2 freq potato (3) - 11 freq potata (3) - 1 freq goams (3) - 2 freq pomes (3) - 1 freq portals (3) - 1 freq potts (3) - 1 freq potash (3) - 1 freq tam's (3) - 31 freq primus (3) - 6 freq poame (3) - 1 freq photas (3) - 2 freq tagus (3) - 1 freq pøramus (3) - 1 freq stamps (3) - 14 freq rotas (3) - 2 freq dolmus (3) - 1 freq polaris (3) - 3 freq poats (3) - 2 freq cothous (3) - 9 freq pomatum (3) - 1 freq seamus (3) - 3 freq dotards (3) - 1 freq |
potamus (0) - 1 freq poames (3) - 2 freq potus (3) - 1 freq pot's (4) - 2 freq tamas (4) - 4 freq poyems (4) - 9 freq pyjamas (4) - 6 freq poiems (4) - 2 freq proamis (4) - 1 freq potions (4) - 11 freq podemos (4) - 4 freq potatoes (4) - 7 freq poyums (4) - 5 freq litmus (4) - 1 freq tams (4) - 4 freq potties (4) - 1 freq poyims (4) - 3 freq petals (4) - 22 freq piteous (4) - 3 freq pots (4) - 44 freq poms (4) - 1 freq poraamis (4) - 1 freq poems (4) - 277 freq totems (4) - 3 freq primus (4) - 6 freq |
SoundEx code - P352 patience - 45 freq putting - 15 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 - 4 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 - PTMS potamus - 1 freq podemos - 4 freq |
POTAMUS |
| Time to execute Levenshtein function - 0.187697 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.333342 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.027477 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.037112 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.000850 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. |