| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| viable (0) - 11 freq visable (1) - 1 freq liable (1) - 4 freq unable (2) - 19 freq vibe (2) - 9 freq ible (2) - 1 freq amiable (2) - 1 freq jibble (2) - 4 freq enviable (2) - 1 freq ville (2) - 1 freq vale (2) - 8 freq dibble (2) - 1 freq friable (2) - 2 freq able (2) - 430 freq bible (2) - 93 freq sable (2) - 2 freq wimble (2) - 1 freq unviable (2) - 1 freq sitable (2) - 2 freq yable (2) - 7 freq nimble (2) - 1 freq gibble (2) - 1 freq fixable (2) - 1 freq vikabe (2) - 1 freq gable (2) - 8 freq |
viable (0) - 11 freq liable (2) - 4 freq visable (2) - 1 freq feable (3) - 1 freq mable (3) - 2 freq vile (3) - 14 freq yable (3) - 7 freq cable (3) - 10 freq gable (3) - 8 freq vocable (3) - 1 freq variable (3) - 5 freq yibble (3) - 3 freq aible (3) - 2 freq -able (3) - 1 freq unviable (3) - 1 freq fable (3) - 8 freq sable (3) - 2 freq arable (3) - 8 freq enviable (3) - 1 freq amiable (3) - 1 freq ible (3) - 1 freq unable (3) - 19 freq vibe (3) - 9 freq ville (3) - 1 freq vale (3) - 8 freq |
SoundEx code - V140 viable - 11 freq vievely - 1 freq |
MetaPhone code - FBL feeble - 9 freq feebly - 6 freq fable - 8 freq feable - 1 freq viable - 11 freq 'feeble - 1 freq fooball - 1 freq |
VIABLE |
| Time to execute Levenshtein function - 0.181617 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.334903 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.027375 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.036408 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.000810 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. |