| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| viscus (0) - 1 freq discus (1) - 1 freq viscous (1) - 1 freq vincust (2) - 1 freq fuscus (2) - 2 freq discs (2) - 3 freq miscas (2) - 1 freq vistas (2) - 3 freq missus (2) - 128 freq vices (2) - 12 freq visits (2) - 24 freq discuss (2) - 23 freq nicus (2) - 1 freq visua (2) - 1 freq virus (2) - 57 freq discos (2) - 6 freq pisces (2) - 3 freq vicous (2) - 1 freq vics (2) - 1 freq circus (2) - 32 freq winces (3) - 3 freq aircs (3) - 1 freq rictus (3) - 2 freq rises (3) - 42 freq rescues (3) - 1 freq |
viscus (0) - 1 freq viscous (1) - 1 freq discus (2) - 1 freq discos (3) - 6 freq pisces (3) - 3 freq vics (3) - 1 freq visits (3) - 24 freq vicous (3) - 1 freq vices (3) - 12 freq discs (3) - 3 freq vistas (3) - 3 freq fuscus (3) - 2 freq miscas (3) - 1 freq vests (4) - 4 freq visions (4) - 7 freq vyces (4) - 65 freq 'scuse (4) - 2 freq voyces (4) - 1 freq voss (4) - 10 freq scuse (4) - 2 freq tescos (4) - 8 freq voices (4) - 113 freq vicious (4) - 17 freq fasces (4) - 1 freq veisits (4) - 8 freq |
SoundEx code - V220 voices - 113 freq voices- - 3 freq vyces - 65 freq veicious - 6 freq vices - 12 freq vicious - 17 freq visage - 3 freq vicous - 1 freq viscous - 1 freq voicees - 1 freq viccy's - 1 freq vacuous - 2 freq vegas - 1 freq veggies - 9 freq viscus - 1 freq veesiks - 2 freq vawses - 1 freq vossis - 2 freq voyces - 1 freq veecious - 2 freq vexes - 3 freq vycikie - 6 freq vaiges - 1 freq vizzies - 3 freq vases - 3 freq vaxx-jegs - 1 freq vcwycg - 1 freq vpszuk - 1 freq vsxkquyzk - 1 freq vgos - 1 freq vkjeoxha - 1 freq 'voices - 1 freq vczjjiacw - 1 freq |
MetaPhone code - FSKS fissoag's - 1 freq viscous - 1 freq physics - 3 freq fizzogs - 6 freq viscus - 1 freq fuscus - 2 freq phisogs - 1 freq veesiks - 2 freq physogs - 1 freq physiques - 1 freq vizx - 1 freq vasx - 1 freq |
VISCUS |
| Time to execute Levenshtein function - 0.240359 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.386387 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.029474 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.039411 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.001002 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. |