| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| avaelable (0) - 2 freq available (1) - 128 freq 'available (2) - 1 freq abailable (2) - 1 freq saveable (3) - 1 freq paesable (3) - 1 freq unavailable (3) - 1 freq valuable (3) - 18 freq paecable (3) - 1 freq veluable (3) - 3 freq variable (3) - 5 freq availabil (3) - 1 freq adappable (3) - 1 freq agreeable (3) - 3 freq adaptable (3) - 1 freq vailuable (3) - 4 freq manageable (4) - 1 freq attainable (4) - 2 freq playable (4) - 4 freq acceptable (4) - 25 freq likeable (4) - 2 freq atremble (4) - 1 freq veesible (4) - 4 freq yaisable (4) - 1 freq payable (4) - 1 freq |
avaelable (0) - 2 freq available (1) - 128 freq availabil (3) - 1 freq valuable (3) - 18 freq vailuable (3) - 4 freq veluable (3) - 3 freq abailable (3) - 1 freq 'available (3) - 1 freq variable (4) - 5 freq unavailable (4) - 1 freq voluble (4) - 1 freq invaluable (5) - 6 freq viable (5) - 11 freq visable (5) - 1 freq vocable (5) - 1 freq playable (5) - 4 freq reliable (5) - 5 freq veesible (5) - 4 freq agreeable (5) - 3 freq paecable (5) - 1 freq valuables (5) - 3 freq paesable (5) - 1 freq saveable (5) - 1 freq kenable (6) - 19 freq advisable (6) - 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 |
AVAELABLE |
| Time to execute Levenshtein function - 0.193828 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.367982 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.027176 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.039298 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.001219 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. |