| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vaigin (0) - 4 freq vigin (1) - 1 freq vaigit (1) - 1 freq vaigins (1) - 1 freq vaegin (1) - 1 freq maikin (2) - 1 freq laidin (2) - 2 freq gaggin (2) - 7 freq voicin (2) - 1 freq aitin (2) - 21 freq baggin (2) - 2 freq bangin (2) - 41 freq raisin (2) - 33 freq agin (2) - 703 freq aixin (2) - 1 freq vain (2) - 30 freq jaggin (2) - 9 freq nailin (2) - 1 freq valuin (2) - 2 freq ragin (2) - 67 freq vaiged (2) - 1 freq gangin (2) - 72 freq vapin (2) - 1 freq maggin (2) - 4 freq aisin (2) - 1 freq |
vaigin (0) - 4 freq vigin (1) - 1 freq vaegin (1) - 1 freq vaigins (2) - 1 freq vaigit (2) - 1 freq aegin (3) - 1 freq vegan (3) - 12 freq aigan (3) - 1 freq vaiges (3) - 1 freq aidgin (3) - 1 freq oagin (3) - 6 freq virgin (3) - 34 freq voyagin (3) - 5 freq baegin (3) - 2 freq origin (3) - 24 freq vaiger (3) - 1 freq vigil (3) - 53 freq imaigin (3) - 2 freq vapin (3) - 1 freq raign (3) - 3 freq vengin (3) - 1 freq vain (3) - 30 freq valuin (3) - 2 freq agin (3) - 703 freq voicin (3) - 1 freq |
SoundEx code - V250 vexin - 5 freq veesion - 25 freq vision - 61 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 - FJN fidgin - 13 freq vaegin - 1 freq vaigin - 4 freq vigin - 1 freq vågen - 1 freq wvjn - 1 freq fjgn - 1 freq wfajn - 1 freq |
VAIGIN |
| Time to execute Levenshtein function - 0.240655 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.399334 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.035355 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.045792 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.000909 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. |