Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
photoshop (0) - 1 freq potshot (3) - 1 freq photos' (3) - 1 freq photos (3) - 40 freq ukphotoshow (3) - 1 freq pooshin (4) - 2 freq photon (4) - 1 freq poosh (4) - 2 freq hooshed (4) - 1 freq 'hooshin (4) - 2 freq hooshin (4) - 1 freq shooshed (4) - 2 freq photons (4) - 2 freq 'photos (4) - 1 freq hohoho (4) - 2 freq whoosh (4) - 4 freq photieshoot (4) - 1 freq pooshion (4) - 1 freq photo-shopped (4) - 1 freq phosphor (4) - 1 freq whooshti (4) - 1 freq whoosht (4) - 3 freq chop-chop (4) - 1 freq photoies (4) - 1 freq photo's (4) - 4 freq |
photoshop (0) - 1 freq potshot (5) - 1 freq ukphotoshow (5) - 1 freq photieshoot (5) - 1 freq photos' (5) - 1 freq photos (5) - 40 freq photes (6) - 1 freq photas (6) - 2 freq papershop (6) - 3 freq shitshow (6) - 3 freq potash (6) - 1 freq wotship (6) - 1 freq photis (6) - 1 freq chipshop (6) - 1 freq toyshop (6) - 1 freq photoies (6) - 1 freq chopchop (7) - 1 freq phobos (7) - 3 freq shoosht (7) - 1 freq photo (7) - 74 freq photograph (7) - 21 freq hotspot (7) - 1 freq whitsup (7) - 1 freq paitish (7) - 1 freq photaes (7) - 9 freq |
SoundEx code - P321 pots-buta - 1 freq pit-cowp - 1 freq puddockflunkie - 1 freq pittsburgh - 3 freq pitchfork - 1 freq photocopyin - 2 freq pitch-black - 1 freq patch-bay - 1 freq photocoapie - 1 freq photocopiers - 1 freq photo-copier - 1 freq pitchforks - 3 freq pitch-perfeck - 1 freq phdtkpt - 1 freq pdtasfh - 1 freq photocopier - 1 freq photoshop - 1 freq photo-shopped - 1 freq pfptcvc - 1 freq |
MetaPhone code - FTXP photoshop - 1 freq |
PHOTOSHOP |
Time to execute Levenshtein function - 0.218168 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.372385 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.032063 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.038728 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.000921 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. |