| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| variable (0) - 5 freq warkable (2) - 1 freq amiable (2) - 1 freq veritable (2) - 2 freq valuable (2) - 18 freq arable (2) - 8 freq variance (2) - 2 freq friable (2) - 2 freq viable (2) - 11 freq parable (2) - 54 freq ariadne (3) - 4 freq marble (3) - 20 freq liable (3) - 4 freq habitable (3) - 4 freq payable (3) - 1 freq vailuable (3) - 4 freq enviable (3) - 1 freq sociable (3) - 7 freq wirkable (3) - 1 freq tribble (3) - 31 freq reliable (3) - 5 freq heritable (3) - 4 freq parables (3) - 9 freq avaelable (3) - 2 freq caapable (3) - 1 freq |
variable (0) - 5 freq viable (3) - 11 freq parable (3) - 54 freq arable (3) - 8 freq friable (3) - 2 freq veritable (3) - 2 freq valuable (3) - 18 freq visable (4) - 1 freq vocable (4) - 1 freq visible (4) - 22 freq invariably (4) - 1 freq verbal (4) - 28 freq avaelable (4) - 2 freq available (4) - 126 freq veluable (4) - 3 freq vailuable (4) - 4 freq mairble (4) - 4 freq amiable (4) - 1 freq warkable (4) - 1 freq marble (4) - 20 freq variance (4) - 2 freq bearable (4) - 5 freq parabola (5) - 2 freq taible (5) - 2 freq venerable (5) - 1 freq |
SoundEx code - V614 verbal - 28 freq verball - 1 freq variable - 5 freq variabeility - 1 freq verbally - 1 freq vrpplzs - 1 freq verbalpunchbag - 17 freq verbals - 1 freq |
MetaPhone code - FRBL verbal - 28 freq friable - 2 freq verball - 1 freq variable - 5 freq verbally - 1 freq |
VARIABLE |
| Time to execute Levenshtein function - 0.200197 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.397509 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.026863 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.038349 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.000820 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. |