| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ppthomson (0) - 1 freq thomson (2) - 26 freq thompson (3) - 5 freq thomsonx (3) - 1 freq thamson (3) - 1 freq thomson' (3) - 1 freq tomsin (4) - 2 freq 'poison (4) - 1 freq nicholson (4) - 1 freq python (4) - 1 freq pythons (4) - 1 freq thoosan (4) - 114 freq uptoon (4) - 1 freq pattison (4) - 1 freq samhowson (4) - 1 freq thamsons (4) - 1 freq thomsonnn (4) - 1 freq poison (4) - 28 freq paterson (4) - 14 freq pathos (4) - 5 freq thomson's (4) - 1 freq tamson (4) - 32 freq fathoms (4) - 2 freq patterson (4) - 10 freq thoosen (4) - 2 freq |
ppthomson (0) - 1 freq thomson (4) - 26 freq thamson (5) - 1 freq ingethomson (6) - 3 freq thomson' (6) - 1 freq patmason (6) - 1 freq thompson (6) - 5 freq thomsonx (6) - 1 freq patterson (7) - 10 freq thoosen (7) - 2 freq fathoms (7) - 2 freq tamson (7) - 32 freq mctamson (7) - 1 freq peterson (7) - 2 freq thousan (7) - 44 freq pathos (7) - 5 freq thoosin (7) - 1 freq thomasina (7) - 5 freq petson (7) - 1 freq mathieson (7) - 18 freq pattison (7) - 1 freq pythons (7) - 1 freq python (7) - 1 freq tomsin (7) - 2 freq thoosan (7) - 114 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 - P0MSN ppthomson - 1 freq |
PPTHOMSON |
| Time to execute Levenshtein function - 0.235280 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.376747 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.028176 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.038192 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.000947 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. |