Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
versus (0) - 7 freq verus (1) - 1 freq verses (1) - 59 freq erss (2) - 3 freq versie (2) - 1 freq serius (2) - 1 freq vershun (2) - 2 freq jeesus (2) - 2 freq verb's (2) - 1 freq erses (2) - 23 freq verse (2) - 134 freq verdur (2) - 1 freq vertue (2) - 2 freq verbs (2) - 98 freq verse' (2) - 1 freq venus (2) - 32 freq vers (2) - 1 freq versed (2) - 4 freq virus (2) - 57 freq vests (2) - 4 freq verges (2) - 5 freq vera's (2) - 3 freq versa (2) - 4 freq hercus (2) - 1 freq versy (2) - 1 freq |
versus (0) - 7 freq verses (1) - 59 freq verus (2) - 1 freq versa (3) - 4 freq verges (3) - 5 freq versed (3) - 4 freq versy (3) - 1 freq virus (3) - 57 freq serss (3) - 1 freq viruses (3) - 3 freq overseas (3) - 2 freq gerss (3) - 5 freq ferss (3) - 1 freq vers (3) - 1 freq varius (3) - 1 freq vera's (3) - 3 freq versie (3) - 1 freq erses (3) - 23 freq erss (3) - 3 freq verse (3) - 134 freq vairses (3) - 1 freq verbs (3) - 98 freq verse' (3) - 1 freq virtues (4) - 7 freq averts (4) - 1 freq |
SoundEx code - V622 vairses - 1 freq verses - 59 freq varicose - 2 freq versus - 7 freq viruses - 3 freq 'versace' - 1 freq veruca's - 3 freq verges - 5 freq vrachos - 1 freq voraciously - 1 freq virus-wyse - 1 freq voarxayj - 1 freq |
MetaPhone code - FRSS vairses - 1 freq verses - 59 freq versus - 7 freq ferocious - 4 freq forces - 42 freq viruses - 3 freq foresees - 1 freq phrases - 68 freq freezes - 4 freq 'versace' - 1 freq forces' - 1 freq farces - 1 freq pharisees - 65 freq pharisee's - 2 freq ferssis - 3 freq phrasies - 1 freq virus-wyse - 1 freq |
VERSUS |
Time to execute Levenshtein function - 0.274187 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.378521 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.027301 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.041278 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.000924 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. |