| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pythons (0) - 1 freq python (1) - 1 freq pytheas (2) - 1 freq pathos (2) - 5 freq pylons (2) - 5 freq €œthons (2) - 1 freq potions (2) - 11 freq mythos (2) - 1 freq kythins (2) - 1 freq thons (2) - 15 freq patrons (2) - 4 freq myths (3) - 18 freq persons (3) - 13 freq poons (3) - 1 freq eatons (3) - 2 freq prisons (3) - 1 freq nuthins (3) - 1 freq pistons (3) - 2 freq yoons (3) - 8 freq fathoms (3) - 2 freq phone (3) - 509 freq athens (3) - 17 freq psychos (3) - 3 freq €˜thon (3) - 2 freq patron's (3) - 1 freq |
pythons (0) - 1 freq python (2) - 1 freq potions (3) - 11 freq thons (3) - 15 freq patrons (3) - 4 freq pathos (3) - 5 freq pytheas (3) - 1 freq kythins (3) - 1 freq pathies (4) - 1 freq patrones (4) - 1 freq athins (4) - 2 freq paths (4) - 32 freq options (4) - 28 freq thins (4) - 2 freq nothins (4) - 1 freq aathins (4) - 3 freq peths (4) - 3 freq path's (4) - 5 freq bathans (4) - 1 freq phones (4) - 50 freq pathogens (4) - 1 freq tithonus (4) - 1 freq thens (4) - 2 freq thans (4) - 3 freq mythos (4) - 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 - P0NS pithiness - 1 freq pythons - 1 freq |
PYTHONS |
| Time to execute Levenshtein function - 0.236762 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.395663 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.027768 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.037578 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.000951 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. |