| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vampires (0) - 8 freq vampires' (1) - 1 freq vampire (1) - 14 freq empires (2) - 8 freq campfires (2) - 1 freq impires (2) - 1 freq tammies (3) - 1 freq vampiredom (3) - 1 freq ramparts (3) - 2 freq varies (3) - 2 freq gamies (3) - 11 freq hempies (3) - 2 freq aspire (3) - 4 freq spires (3) - 2 freq saltires (3) - 6 freq mammies (3) - 8 freq umpire's (3) - 1 freq ramples (3) - 1 freq sambies (3) - 1 freq empire's (3) - 6 freq compares (3) - 7 freq nappies (3) - 9 freq samples (3) - 2 freq campie (3) - 16 freq empire' (3) - 1 freq |
vampires (0) - 8 freq vampire (2) - 14 freq vampires' (2) - 1 freq impires (3) - 1 freq empires (3) - 8 freq comperes (4) - 1 freq campers (4) - 2 freq compares (4) - 7 freq impyres (4) - 1 freq campfires (4) - 1 freq vimmirs (4) - 1 freq pampered (5) - 1 freq vapours (5) - 1 freq impire (5) - 2 freq empires' (5) - 2 freq inspires (5) - 3 freq mires (5) - 3 freq campsies (5) - 1 freq tempers (5) - 2 freq vipers (5) - 5 freq kempers (5) - 2 freq dumpers (5) - 1 freq jumpers (5) - 16 freq expires (5) - 1 freq empire (5) - 82 freq |
SoundEx code - V516 vampire - 14 freq vampires - 8 freq vampires' - 1 freq vampiredom - 1 freq |
MetaPhone code - FMPRS vampires - 8 freq vampires' - 1 freq |
VAMPIRES |
| Time to execute Levenshtein function - 0.327579 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.616935 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.061505 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.079561 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.000923 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. |