| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vacuum (0) - 5 freq vaccum (1) - 1 freq vaccuum (1) - 1 freq vacuums (1) - 2 freq vacuous (2) - 1 freq acum (2) - 1 freq valium (2) - 3 freq sacrum (2) - 1 freq caum (3) - 36 freq oancum (3) - 1 freq gaulum (3) - 1 freq fuckum (3) - 1 freq upcum (3) - 2 freq chum (3) - 21 freq value (3) - 64 freq vac (3) - 1 freq packam (3) - 1 freq vault (3) - 5 freq vollum (3) - 4 freq vacuuming (3) - 1 freq acrm (3) - 1 freq valuin (3) - 2 freq a'sum (3) - 1 freq racism (3) - 28 freq nahum (3) - 3 freq |
vacuum (0) - 5 freq vacuums (2) - 2 freq vaccuum (2) - 1 freq vaccum (2) - 1 freq vacyoom (3) - 1 freq vcm (3) - 1 freq valium (3) - 3 freq acum (3) - 1 freq vacuous (3) - 1 freq 'cum (4) - 4 freq lyceum (4) - 6 freq tocum (4) - 1 freq vack (4) - 1 freq scum (4) - 11 freq volum (4) - 1 freq victim (4) - 29 freq vadim (4) - 1 freq bicum (4) - 2 freq coum (4) - 2 freq becum (4) - 24 freq evacuee (4) - 1 freq baecum (4) - 3 freq vacate (4) - 1 freq macm (4) - 1 freq 'caum (4) - 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 - FKM vacuum - 5 freq vogm - 1 freq fuckum - 1 freq vwkm - 1 freq vcm - 1 freq vvqmy - 1 freq |
VACUUM |
| Time to execute Levenshtein function - 0.174761 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.325969 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.028840 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.036720 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.000776 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. |