| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vodka (0) - 24 freq vod (2) - 1 freq voddy (2) - 2 freq vada (2) - 1 freq vockal (2) - 1 freq coda (2) - 3 freq oda (2) - 5 freq joda (2) - 3 freq vork (2) - 1 freq oka (2) - 1 freq tonka (2) - 2 freq vodd (2) - 2 freq soda (2) - 20 freq wonka (2) - 297 freq roka (2) - 3 freq vosk (2) - 1 freq yoda (2) - 3 freq roda (2) - 1 freq lokka (2) - 1 freq polka (2) - 6 freq moka (2) - 1 freq nods (3) - 61 freq voodo (3) - 1 freq dodgan (3) - 1 freq cudda (3) - 2 freq |
vodka (0) - 24 freq vod (3) - 1 freq vosk (3) - 1 freq vork (3) - 1 freq vodd (3) - 2 freq vada (3) - 1 freq voddy (3) - 2 freq video (4) - 105 freq kodak (4) - 1 freq dok (4) - 1 freq vid (4) - 4 freq vdef (4) - 1 freq vidyo (4) - 1 freq dk (4) - 4 freq dook (4) - 32 freq vidi (4) - 1 freq vicki (4) - 23 freq doke (4) - 3 freq vack (4) - 1 freq vidjo (4) - 3 freq vk (4) - 5 freq virk (4) - 1 freq vido (4) - 1 freq void (4) - 17 freq voddie (4) - 8 freq |
SoundEx code - V320 vdus - 1 freq vodka - 24 freq vats - 2 freq vets - 9 freq votes - 69 freq veet's - 1 freq videos - 19 freq viddies - 1 freq voits - 2 freq vettese - 1 freq voytek - 1 freq vet's - 1 freq vidjo - 3 freq vteso - 1 freq video's - 2 freq vtz - 1 freq vids - 2 freq vdqzy - 1 freq vtuq - 1 freq vdcy - 1 freq |
MetaPhone code - FTK vodka - 24 freq fatigue - 6 freq voytek - 1 freq wfytthcw - 1 freq ftk - 1 freq fwtk - 1 freq vtuq - 1 freq |
VODKA |
| Time to execute Levenshtein function - 0.184753 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.365207 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.028021 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.037955 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.000956 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. |