| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| variabeility (0) - 1 freq viability (3) - 1 freq affabeility (3) - 1 freq visability (4) - 2 freq adaptabeility (4) - 1 freq availability (4) - 5 freq stabeility (4) - 1 freq veisbility (4) - 1 freq visibility (4) - 4 freq versatility (4) - 2 freq capability (4) - 1 freq liability (4) - 5 freq abeility (4) - 4 freq abeelity (5) - 7 freq probability (5) - 2 freq variety (5) - 62 freq raelity (5) - 1 freq variable (5) - 5 freq possibeility (5) - 1 freq asiareilly (5) - 5 freq instabeelity (5) - 1 freq usability (5) - 1 freq hability (5) - 2 freq volatility (5) - 1 freq readability (5) - 1 freq |
variabeility (0) - 1 freq viability (4) - 1 freq visibility (5) - 4 freq veisbility (5) - 1 freq availability (5) - 5 freq affabeility (5) - 1 freq visability (5) - 2 freq veesibility (6) - 1 freq variable (6) - 5 freq liability (6) - 5 freq abeility (6) - 4 freq capability (6) - 1 freq versatility (6) - 2 freq stabeility (6) - 1 freq marbelt (7) - 1 freq feasibility (7) - 6 freq fragility (7) - 2 freq stability (7) - 3 freq ability (7) - 44 freq probabeelity (7) - 1 freq notability (7) - 1 freq inability (7) - 6 freq fraility (7) - 1 freq disabeelity (7) - 1 freq disability (7) - 5 freq |
SoundEx code - V614 verbal - 29 freq verball - 1 freq variable - 5 freq variabeility - 1 freq verbally - 1 freq vrpplzs - 1 freq verbalpunchbag - 17 freq verbals - 1 freq |
MetaPhone code - FRBLT variabeility - 1 freq |
VARIABEILITY |
| Time to execute Levenshtein function - 0.307624 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.474806 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.030997 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.040112 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.001163 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. |