| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| available (0) - 128 freq 'available (1) - 1 freq abailable (1) - 1 freq avaelable (1) - 2 freq availabil (2) - 1 freq unavailable (2) - 1 freq vailuable (2) - 4 freq viable (3) - 11 freq attainable (3) - 2 freq amiable (3) - 1 freq visable (3) - 1 freq amicable (3) - 2 freq valuable (3) - 18 freq adappable (3) - 1 freq yaisable (3) - 1 freq adaptable (3) - 1 freq variable (3) - 5 freq advisable (3) - 4 freq imaginable (4) - 1 freq unassailable (4) - 1 freq abominable (4) - 1 freq availability (4) - 5 freq unavoidable (4) - 3 freq vailye (4) - 6 freq adorable (4) - 8 freq |
available (0) - 128 freq avaelable (1) - 2 freq vailuable (2) - 4 freq abailable (2) - 1 freq availabil (2) - 1 freq 'available (2) - 1 freq valuable (3) - 18 freq unavailable (3) - 1 freq variable (4) - 5 freq veluable (4) - 3 freq viable (4) - 11 freq visable (4) - 1 freq voluble (4) - 1 freq vocable (5) - 1 freq valuables (5) - 3 freq vaillie (5) - 1 freq invaluable (5) - 6 freq veisible (5) - 1 freq reliable (5) - 5 freq liable (5) - 4 freq vaill (5) - 7 freq vailley (5) - 6 freq ville (5) - 1 freq visible (5) - 24 freq playable (5) - 4 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 - AFLBL available - 128 freq availabil - 1 freq avaelable - 2 freq 'available - 1 freq |
AVAILABLE |
| Time to execute Levenshtein function - 0.249509 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.462590 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.030998 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.045338 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.000900 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. |