| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vampire (0) - 14 freq vampires (1) - 8 freq vampires' (2) - 1 freq amyire (2) - 1 freq empire (2) - 82 freq campie (2) - 16 freq impire (2) - 2 freq aspire (2) - 3 freq samphire (2) - 1 freq campfire (2) - 3 freq hamper (3) - 3 freq campit (3) - 2 freq pumpie (3) - 2 freq rammie (3) - 9 freq wappie (3) - 1 freq camper (3) - 1 freq gramaire (3) - 1 freq tawpie (3) - 1 freq mammie (3) - 6 freq vadlure (3) - 6 freq vairy (3) - 1 freq apsire (3) - 1 freq vaudie (3) - 1 freq rampin (3) - 4 freq empire' (3) - 1 freq |
vampire (0) - 14 freq vampires (2) - 8 freq impire (3) - 2 freq empire (3) - 82 freq camper (4) - 1 freq impure (4) - 1 freq tamper (4) - 1 freq compere (4) - 6 freq compare (4) - 58 freq impyre (4) - 2 freq rampur (4) - 1 freq damper (4) - 3 freq pamper (4) - 2 freq campie (4) - 16 freq aspire (4) - 3 freq samphire (4) - 1 freq amyire (4) - 1 freq hamper (4) - 3 freq campfire (4) - 3 freq vampires' (4) - 1 freq vamoose (5) - 1 freq expire (5) - 2 freq campers (5) - 2 freq bumper (5) - 3 freq mire (5) - 14 freq |
SoundEx code - V516 vampire - 14 freq vampires - 8 freq vampires' - 1 freq vampiredom - 1 freq |
MetaPhone code - FMPR vampire - 14 freq |
VAMPIRE |
| Time to execute Levenshtein function - 0.190067 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.371141 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.027206 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.036656 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.000841 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. |