| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enviable (0) - 1 freq unviable (1) - 1 freq viable (2) - 11 freq enable (2) - 4 freq ansible (3) - 2 freq amiable (3) - 1 freq enabled (3) - 1 freq venerable (3) - 1 freq inevitable (3) - 26 freq renewable (3) - 2 freq variable (3) - 5 freq kenable (3) - 19 freq unstable (3) - 1 freq enjeyable (3) - 1 freq unvisible (3) - 1 freq reliable (3) - 5 freq visable (3) - 1 freq tenable (3) - 1 freq invisible (3) - 44 freq kennable (3) - 3 freq nibble (3) - 8 freq liable (3) - 4 freq moveable (3) - 1 freq notable (3) - 5 freq loveable (3) - 1 freq |
enviable (0) - 1 freq unviable (1) - 1 freq enable (3) - 4 freq viable (3) - 11 freq enjeyable (4) - 1 freq saveable (4) - 1 freq enjoyable (4) - 7 freq moveable (4) - 1 freq invisible (4) - 44 freq unvisible (4) - 1 freq inevitable (4) - 26 freq unable (4) - 19 freq ansible (4) - 2 freq nimble (4) - 1 freq nibble (4) - 8 freq loveable (4) - 1 freq notable (4) - 5 freq peetiable (5) - 2 freq sociable (5) - 7 freq sensible (5) - 33 freq anvil (5) - 5 freq unavailable (5) - 1 freq neville (5) - 14 freq inevitably (5) - 10 freq enviously (5) - 1 freq |
SoundEx code - E511 envyfu - 1 freq empie-free - 1 freq enviable - 1 freq enfeebled - 1 freq |
MetaPhone code - ENFBL enviable - 1 freq |
ENVIABLE |
| Time to execute Levenshtein function - 0.198221 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.389457 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.027621 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.040974 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.000827 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. |