| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vampires (0) - 8 freq vampire (1) - 14 freq vampires' (1) - 1 freq impires (2) - 1 freq empires (2) - 8 freq campfires (2) - 1 freq empires' (3) - 2 freq nappies (3) - 9 freq tammies (3) - 1 freq lambies (3) - 4 freq vairses (3) - 1 freq mires (3) - 3 freq impyres (3) - 1 freq vampiredom (3) - 1 freq hempies (3) - 2 freq suspires (3) - 1 freq vaiges (3) - 1 freq saltires (3) - 6 freq vaines (3) - 1 freq expires (3) - 1 freq empire (3) - 82 freq mammies (3) - 7 freq impire (3) - 2 freq samples (3) - 2 freq gamies (3) - 11 freq |
vampires (0) - 8 freq vampires' (2) - 1 freq vampire (2) - 14 freq empires (3) - 8 freq impires (3) - 1 freq impyres (4) - 1 freq vimmirs (4) - 1 freq compares (4) - 7 freq campers (4) - 2 freq comperes (4) - 1 freq campfires (4) - 1 freq umpire's (5) - 1 freq spires (5) - 2 freq tempers (5) - 2 freq dumpers (5) - 1 freq ramparts (5) - 2 freq mappies (5) - 13 freq varies (5) - 2 freq kempers (5) - 2 freq empire's (5) - 5 freq campie's (5) - 1 freq jumpers (5) - 15 freq vipers (5) - 5 freq empire' (5) - 1 freq inspires (5) - 3 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.199159 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.375967 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.027488 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.038402 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.000859 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. |