Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
vocalism (0) - 1 freq localism (1) - 1 freq socialism (2) - 22 freq loyalism (2) - 2 freq nomadism (3) - 1 freq idealism (3) - 2 freq poalis (3) - 1 freq vocal (3) - 10 freq moralise (3) - 1 freq vandalism (3) - 2 freq vocation (3) - 2 freq vocables (3) - 1 freq vocalized (3) - 1 freq populism (3) - 2 freq vocative (3) - 1 freq dualism (3) - 1 freq royalist (3) - 2 freq localised (3) - 8 freq locality (3) - 3 freq realism (3) - 3 freq socialist (3) - 17 freq valium (3) - 3 freq locals (3) - 39 freq socialise (3) - 9 freq locals' (3) - 1 freq |
vocalism (0) - 1 freq localism (2) - 1 freq socialism (3) - 22 freq loyalism (4) - 2 freq realism (5) - 3 freq localised (5) - 8 freq dualism (5) - 1 freq socialist (5) - 17 freq socialise (5) - 9 freq voiceless (5) - 19 freq populism (5) - 2 freq locals (5) - 39 freq valium (5) - 3 freq locals' (5) - 1 freq idealism (5) - 2 freq vandalism (5) - 2 freq vocal (5) - 10 freq vocables (5) - 1 freq vocalized (5) - 1 freq cyclist (6) - 5 freq vollum (6) - 4 freq victim (6) - 29 freq radicalism (6) - 7 freq villish (6) - 1 freq valais (6) - 1 freq |
SoundEx code - V242 vehicles - 14 freq visualise - 1 freq vigils - 1 freq vocalized - 1 freq veshels - 2 freq vessels - 6 freq voiceless - 19 freq vassals - 2 freq visualises - 1 freq vyaachles - 1 freq vocalism - 1 freq |
MetaPhone code - FKLSM vocalism - 1 freq |
VOCALISM |
Time to execute Levenshtein function - 0.414423 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.575930 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.028212 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.040344 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.000892 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. |