| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| phdtkpt (0) - 1 freq phuket (3) - 1 freq ihttkp (3) - 1 freq shockit (4) - 1 freq phd (4) - 9 freq hapt (4) - 5 freq pokkit (4) - 1 freq 'https (4) - 1 freq hytert (4) - 3 freq hokkit (4) - 1 freq chackt (4) - 4 freq whitrat (4) - 2 freq phkan (4) - 1 freq philope (4) - 2 freq pratt (4) - 1 freq pintit (4) - 14 freq photaes (4) - 9 freq photae (4) - 24 freq poket (4) - 4 freq shakkit (4) - 1 freq poacket (4) - 37 freq pickt (4) - 13 freq pykt (4) - 1 freq phuten (4) - 1 freq hockit (4) - 3 freq |
phdtkpt (0) - 1 freq ihttkp (6) - 1 freq phuket (6) - 1 freq hotspot (7) - 1 freq pit-pat (7) - 2 freq hotpot (7) - 1 freq pent-pot (7) - 1 freq phipps (8) - 1 freq hukt (8) - 1 freq paddult (8) - 2 freq phota (8) - 1 freq thitk (8) - 1 freq hawkit (8) - 1 freq henkit (8) - 1 freq plinkit (8) - 2 freq hookit (8) - 1 freq putit (8) - 2 freq chappt (8) - 3 freq ptbt (8) - 1 freq pitt (8) - 8 freq photo's (8) - 4 freq wudpt (8) - 1 freq pactit (8) - 3 freq chuckst (8) - 1 freq hett (8) - 35 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 - FTTKPT phdtkpt - 1 freq |
PHDTKPT |
| Time to execute Levenshtein function - 0.294674 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.409060 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.030508 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.040334 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.000851 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. |