| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| abailable (0) - 1 freq available (1) - 128 freq 'available (2) - 1 freq avaelable (2) - 2 freq vailuable (3) - 4 freq adappable (3) - 1 freq amiable (3) - 1 freq obtainable (3) - 2 freq availabil (3) - 1 freq advisable (3) - 4 freq yaisable (3) - 1 freq adaptable (3) - 1 freq unavailable (3) - 1 freq attainable (3) - 2 freq amicable (3) - 2 freq abominable (3) - 1 freq habitable (3) - 4 freq valuable (4) - 18 freq fixable (4) - 1 freq reliable (4) - 5 freq disable (4) - 1 freq achievable (4) - 4 freq sociable (4) - 7 freq playable (4) - 4 freq arable (4) - 8 freq |
abailable (0) - 1 freq available (2) - 128 freq avaelable (3) - 2 freq bailbail (4) - 1 freq availabil (4) - 1 freq 'available (4) - 1 freq vailuable (4) - 4 freq babble (5) - 2 freq bauble (5) - 5 freq playable (5) - 4 freq liable (5) - 4 freq bailly (5) - 1 freq bille (5) - 2 freq reliable (5) - 5 freq bearable (5) - 5 freq bilabial (5) - 3 freq baillie (5) - 17 freq bible (5) - 95 freq unavailable (5) - 1 freq obtainable (5) - 2 freq abominable (5) - 1 freq amicable (5) - 2 freq habitable (5) - 4 freq amiable (5) - 1 freq valuable (5) - 18 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 - ABLBL abailable - 1 freq |
ABAILABLE |
| Time to execute Levenshtein function - 0.256748 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.419059 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.028683 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.039750 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.001142 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. |