Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
photocopyin (0) - 2 freq photocoapie (3) - 1 freq photocopier (3) - 1 freq photobombin (3) - 1 freq photocopiers (4) - 1 freq photo-copier (4) - 1 freq photographin (4) - 1 freq occupyin (5) - 2 freq phonology (5) - 8 freq poopin (5) - 1 freq hoochin (5) - 2 freq hotchin (5) - 12 freq proteckin (5) - 2 freq philosophie (5) - 5 freq photgraphic (5) - 1 freq stoopin (5) - 4 freq photoshop (5) - 1 freq ootcomin (5) - 1 freq phonologie (5) - 1 freq photon (5) - 1 freq pronooncin (5) - 4 freq photogenic (5) - 1 freq protectin (5) - 10 freq botcoin (5) - 1 freq photographic (5) - 1 freq |
photocopyin (0) - 2 freq photocopier (4) - 1 freq photocoapie (4) - 1 freq photo-copier (6) - 1 freq photocopiers (6) - 1 freq photobombin (6) - 1 freq photon (7) - 1 freq protectin (7) - 10 freq hotchin (7) - 12 freq proteckin (7) - 2 freq photographin (7) - 1 freq whoopin (8) - 5 freq protectan (8) - 1 freq copyin (8) - 8 freq hitchin (8) - 1 freq patchin (8) - 3 freq protocol (8) - 4 freq hootchin (8) - 4 freq protocols (8) - 3 freq hatchin (8) - 5 freq hiccupin (8) - 1 freq pitchin (8) - 2 freq hoatchin (8) - 9 freq protection (8) - 29 freq thatchin (8) - 2 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 - FTKPYN photocopyin - 2 freq |
PHOTOCOPYIN |
Time to execute Levenshtein function - 0.598719 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.921829 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.100412 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.063853 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.000883 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. |