| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vaccine (0) - 6 freq vaccines (1) - 4 freq vaccine' (1) - 1 freq racine (2) - 3 freq baccie (2) - 1 freq machine (2) - 163 freq tagline (3) - 2 freq mankine (3) - 1 freq wacking (3) - 2 freq jardine (3) - 29 freq katrine (3) - 3 freq decline (3) - 20 freq hackin (3) - 7 freq facin' (3) - 1 freq ackin (3) - 5 freq karine (3) - 2 freq hackie (3) - 4 freq vaccuum (3) - 1 freq vacand (3) - 1 freq accent (3) - 108 freq wackin (3) - 1 freq 'actin (3) - 1 freq gacin (3) - 1 freq lacking (3) - 2 freq backin (3) - 41 freq |
vaccine (0) - 6 freq vaccines (2) - 4 freq vaccine' (2) - 1 freq vaccuum (4) - 1 freq siccin (4) - 2 freq cocaine (4) - 6 freq vaccum (4) - 1 freq machine (4) - 163 freq racine (4) - 3 freq baccie (4) - 1 freq voicin (4) - 1 freq chine (5) - 2 freq crine (5) - 2 freq valcik (5) - 1 freq lacin (5) - 1 freq actin (5) - 58 freq lachin (5) - 46 freq dancin (5) - 133 freq canine (5) - 3 freq cline (5) - 4 freq recline (5) - 2 freq accies (5) - 2 freq packin (5) - 20 freq pacce (5) - 1 freq acne (5) - 1 freq |
SoundEx code - V250 vexin - 5 freq veesion - 25 freq vision - 54 freq voyagin - 5 freq vacyoom - 1 freq vaccum - 1 freq voicin - 1 freq vegan - 12 freq 'veesion' - 1 freq vïsion - 2 freq vizzyin - 1 freq vikeen - 2 freq vaccine - 6 freq vaegin - 1 freq vaigin - 4 freq vissiein - 3 freq veisioun - 2 freq vacuum - 5 freq vigin - 1 freq vågen - 1 freq vísion - 1 freq veision - 2 freq vexxin - 1 freq vixen - 1 freq voican - 1 freq vaccuum - 1 freq vogm - 1 freq vconi - 1 freq vwkm - 1 freq vegan' - 1 freq vaccine' - 1 freq vcm - 1 freq vijm - 1 freq 'vision' - 1 freq vvqmy - 1 freq vosene - 1 freq vsn - 1 freq vicschoen - 1 freq |
MetaPhone code - FKSN vexin - 5 freq fixin - 17 freq focusin - 9 freq fackson - 1 freq vaccine - 6 freq fixin' - 1 freq vexxin - 1 freq vixen - 1 freq vaccine' - 1 freq |
VACCINE |
| Time to execute Levenshtein function - 0.179874 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.350814 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.029410 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.037671 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.000783 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. |