| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vpt (0) - 1 freq vst (1) - 1 freq vpp (1) - 1 freq vot (1) - 1 freq vat (1) - 12 freq vpn (1) - 1 freq vbt (1) - 1 freq ept (1) - 1 freq pt (1) - 5 freq apt (1) - 45 freq vps (1) - 1 freq cpt (1) - 1 freq vp (1) - 4 freq vet (1) - 33 freq upt (1) - 2 freq vpg (1) - 2 freq opt (1) - 2 freq vit (1) - 3 freq vpz (1) - 1 freq kpt (1) - 1 freq hut (2) - 85 freq tat (2) - 16 freq rp (2) - 8 freq vr (2) - 5 freq voe (2) - 26 freq |
vpt (0) - 1 freq vet (2) - 33 freq vp (2) - 4 freq cpt (2) - 1 freq upt (2) - 2 freq opt (2) - 2 freq vpz (2) - 1 freq vit (2) - 3 freq vps (2) - 1 freq vpg (2) - 2 freq kpt (2) - 1 freq vst (2) - 1 freq vpp (2) - 1 freq apt (2) - 45 freq vat (2) - 12 freq vot (2) - 1 freq pt (2) - 5 freq vpn (2) - 1 freq ept (2) - 1 freq vbt (2) - 1 freq lipt (3) - 1 freq 'pit (3) - 15 freq vext (3) - 14 freq wept (3) - 7 freq uvpy (3) - 1 freq |
SoundEx code - V300 vote - 253 freq void - 15 freq vat - 12 freq vood - 2 freq vet - 33 freq voot - 1 freq vidi - 1 freq vitae - 3 freq vow'd - 1 freq vot - 1 freq voodoo - 2 freq video - 105 freq voddie - 8 freq viewed - 9 freq veet - 6 freq voddy - 2 freq vid - 4 freq vit - 3 freq vott - 2 freq vowed - 5 freq vodd - 2 freq voyd - 2 freq voyied - 1 freq vod - 1 freq voo'd - 1 freq ve'd - 1 freq vaudie - 1 freq vita - 1 freq voat - 1 freq vóat - 1 freq €œvote - 1 freq vuty - 1 freq vwdh - 1 freq vada - 1 freq vidyo - 1 freq vbt - 1 freq voodo - 1 freq vath - 1 freq vwdy - 1 freq vethe - 1 freq vpt - 1 freq vido - 1 freq vd - 2 freq vbwtwe - 1 freq |
MetaPhone code - FPT fiypt - 1 freq 'vapid - 1 freq vapid - 1 freq vpt - 1 freq wfpd - 1 freq |
VPT |
| Time to execute Levenshtein function - 0.183954 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.356772 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.027730 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.037307 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.000843 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. |