| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| availability (0) - 5 freq viability (3) - 1 freq availabil (3) - 1 freq visability (3) - 2 freq aplicability (3) - 1 freq volatility (4) - 1 freq liability (4) - 5 freq inability (4) - 6 freq veisbility (4) - 1 freq readability (4) - 1 freq adaptabeility (4) - 1 freq visibility (4) - 4 freq available (4) - 128 freq disability (4) - 5 freq capability (4) - 1 freq variabeility (4) - 1 freq veesibility (5) - 1 freq usability (5) - 1 freq notability (5) - 1 freq stability (5) - 3 freq adaptabilitee (5) - 1 freq sustainability (5) - 4 freq hability (5) - 2 freq vitality (5) - 4 freq feasibility (5) - 6 freq |
availability (0) - 5 freq availabil (4) - 1 freq visability (4) - 2 freq viability (4) - 1 freq visibility (5) - 4 freq available (5) - 128 freq veisbility (5) - 1 freq liability (5) - 5 freq aplicability (5) - 1 freq volatility (5) - 1 freq variabeility (5) - 1 freq veesibility (6) - 1 freq avaelable (6) - 2 freq volatilty (6) - 1 freq disability (6) - 5 freq inability (6) - 6 freq capability (6) - 1 freq readability (6) - 1 freq 'available (7) - 1 freq abailable (7) - 1 freq gullibility (7) - 1 freq plausibility (7) - 1 freq inevitability (7) - 2 freq affabeility (7) - 1 freq vaillyiet (7) - 1 freq |
SoundEx code - A141 aipple-boxes - 1 freq available - 128 freq availabil - 1 freq aplift - 1 freq able-bodied - 2 freq avaelable - 2 freq availability - 5 freq auobalba - 13 freq appleby - 2 freq appeleby - 1 freq abailable - 1 freq 'available - 1 freq |
MetaPhone code - AFLBLT availability - 5 freq |
AVAILABILITY |
| Time to execute Levenshtein function - 0.215845 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.428387 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.030476 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.038237 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.000865 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. |