| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pudding (0) - 12 freq padding (1) - 3 freq punding (1) - 1 freq puddin' (1) - 3 freq puddin (1) - 31 freq hudding (1) - 1 freq puddings (1) - 1 freq puddins (1) - 13 freq pudden (2) - 22 freq purging (2) - 1 freq adding (2) - 3 freq huddling (2) - 1 freq scudding (2) - 1 freq wedding (2) - 19 freq pushing (2) - 5 freq puddens (2) - 7 freq puddil (2) - 1 freq pumping (2) - 2 freq judging (2) - 2 freq purring (2) - 1 freq puddlin (2) - 1 freq paddin (2) - 2 freq pending (2) - 1 freq nodding (2) - 4 freq bedding (2) - 1 freq |
pudding (0) - 12 freq padding (1) - 3 freq puddins (2) - 13 freq hudding (2) - 1 freq puddings (2) - 1 freq puddin (2) - 31 freq puddin' (2) - 3 freq punding (2) - 1 freq paddin (3) - 2 freq wadding (3) - 1 freq pounding (3) - 1 freq pending (3) - 1 freq kidding (3) - 8 freq bidding (3) - 4 freq paddling (3) - 3 freq bedding (3) - 1 freq nodding (3) - 4 freq wedding (3) - 19 freq redding (3) - 1 freq ridding (3) - 2 freq pudden (3) - 22 freq puddens (3) - 7 freq adding (3) - 3 freq huddin' (4) - 1 freq fudging (4) - 1 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 - PTNK putting - 15 freq pudding - 12 freq patting - 2 freq pitting - 1 freq padding - 3 freq petanque - 1 freq |
PUDDING |
| Time to execute Levenshtein function - 0.193548 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.329263 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.027630 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.036765 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.000824 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. |