| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vacantly (0) - 1 freq vacant (2) - 8 freq vacancy (2) - 2 freq gallantly (3) - 2 freq aaftly (3) - 1 freq recently (3) - 75 freq cantley (3) - 1 freq sactly (3) - 1 freq dacant (3) - 1 freq vastly (3) - 2 freq raicently (3) - 20 freq canty (3) - 28 freq saicintly (3) - 2 freq vaunty (3) - 2 freq intantly (3) - 1 freq vibrantly (3) - 1 freq cantle (3) - 2 freq scanty (3) - 3 freq saicontly (3) - 2 freq patently (3) - 6 freq vacand (3) - 1 freq blatantly (3) - 3 freq vainly (3) - 3 freq vacate (3) - 1 freq vauntily (3) - 1 freq |
vacantly (0) - 1 freq vacant (3) - 8 freq cantle (4) - 2 freq vauntily (4) - 1 freq saicintly (4) - 2 freq cantily (4) - 12 freq raicently (4) - 20 freq cantley (4) - 1 freq vacancy (4) - 2 freq scantily (4) - 1 freq saicontly (4) - 2 freq recently (4) - 75 freq vacate (5) - 1 freq factly (5) - 1 freq faintly (5) - 12 freq evidently (5) - 25 freq violently (5) - 16 freq cantil (5) - 1 freq vainly (5) - 3 freq seicontly (5) - 1 freq scanty (5) - 3 freq canty (5) - 28 freq vastly (5) - 2 freq dacant (5) - 1 freq sactly (5) - 1 freq |
SoundEx code - V253 vacant - 8 freq vicinity - 8 freq viszontlatdsra - 1 freq viscount - 2 freq visand - 1 freq voice-haunted - 1 freq vegemite's - 1 freq vacand - 1 freq vacantly - 1 freq vignettes - 1 freq vaccinations - 2 freq vaccination - 1 freq vicssundays - 1 freq |
MetaPhone code - FKNTL vacantly - 1 freq |
VACANTLY |
| Time to execute Levenshtein function - 0.349966 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.600238 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.065320 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.039042 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.001171 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. |