Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
visibly (0) - 8 freq visible (1) - 22 freq aisily (2) - 1 freq vigilly (2) - 1 freq visable (2) - 1 freq vividly (2) - 2 freq risible (2) - 1 freq veisible (2) - 1 freq silly (3) - 63 freq timidly (3) - 16 freq unvisible (3) - 1 freq misobey (3) - 1 freq visitin (3) - 22 freq vievely (3) - 1 freq noisily (3) - 9 freq visitir (3) - 1 freq tidily (3) - 1 freq visi (3) - 1 freq aesily (3) - 2 freq sicily (3) - 2 freq audibly (3) - 1 freq miserly (3) - 1 freq ansible (3) - 2 freq dwaibly (3) - 9 freq isaboy (3) - 1 freq |
visibly (0) - 8 freq visible (1) - 22 freq veisible (2) - 1 freq visable (2) - 1 freq veesible (3) - 4 freq risible (3) - 1 freq visual (4) - 5 freq disable (4) - 1 freq visibility (4) - 4 freq visually (4) - 4 freq vastly (4) - 2 freq invisible (4) - 44 freq viable (4) - 11 freq faisible (4) - 3 freq ansible (4) - 2 freq vividly (4) - 2 freq unvisible (4) - 1 freq aisily (4) - 1 freq vigilly (4) - 1 freq isabel (5) - 40 freq verily (5) - 2 freq ovisapl (5) - 1 freq visability (5) - 2 freq vsl (5) - 1 freq vitally (5) - 1 freq |
SoundEx code - V214 vocabulary - 42 freq vocabulary-ainsults - 1 freq visibility - 4 freq vocabularie - 2 freq visible - 22 freq visibly - 8 freq vocabular - 65 freq vicablary - 2 freq veesible - 4 freq vocubalar - 1 freq vocable - 1 freq vocables - 1 freq vizzie-bell - 1 freq visable - 1 freq visability - 2 freq visibleearth - 1 freq vsevolod - 1 freq vocabulars - 3 freq veisbility - 1 freq veesibility - 1 freq veisible - 1 freq visibleotter - 1 freq |
MetaPhone code - FSBL visible - 22 freq visibly - 8 freq feasible - 1 freq veesible - 4 freq faisible - 3 freq vizzie-bell - 1 freq visable - 1 freq veisible - 1 freq |
VISIBLY |
Time to execute Levenshtein function - 0.199457 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.357010 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.027436 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.037760 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.000856 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. |