Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pfptcvc (0) - 1 freq ppcjc (3) - 1 freq fit've (4) - 1 freq captive (4) - 4 freq fpc (4) - 3 freq pitcht (4) - 1 freq patch (4) - 79 freq fcv (4) - 1 freq fjttv (4) - 1 freq platch (4) - 3 freq pontiac (4) - 1 freq patchy (4) - 5 freq fptp (4) - 7 freq ppv (4) - 4 freq vfpvk (4) - 1 freq poutch (4) - 1 freq pvc (4) - 5 freq vfcrcvs (4) - 5 freq fit'v (4) - 1 freq pïtcht (4) - 1 freq pootch (4) - 22 freq ppmvl (4) - 1 freq tevc (4) - 1 freq potch (4) - 3 freq cvc (4) - 2 freq |
pfptcvc (0) - 1 freq ppcjc (6) - 1 freq putca (8) - 1 freq septic (8) - 3 freq xfccc (8) - 2 freq 'fetch (8) - 2 freq ygptlvkc (8) - 1 freq fetch (8) - 62 freq cvc (8) - 2 freq ppyc (8) - 1 freq pfft (8) - 3 freq papt (8) - 6 freq poetic (8) - 35 freq fitch (8) - 3 freq jftlc (8) - 1 freq prtci (8) - 1 freq patcht (8) - 2 freq ntcvq (8) - 1 freq potch (8) - 3 freq papacy (8) - 1 freq hfucva (8) - 1 freq dfpxv (8) - 1 freq pitch (8) - 89 freq fcv (8) - 1 freq tevc (8) - 1 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 - PFPTKFK pfptcvc - 1 freq |
PFPTCVC |
Time to execute Levenshtein function - 0.238191 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.446101 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.028346 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.038680 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.000846 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. |