| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fable (0) - 8 freq sable (1) - 2 freq mable (1) - 2 freq cable (1) - 12 freq fabled (1) - 3 freq table (1) - 686 freq yable (1) - 7 freq fables (1) - 10 freq feable (1) - 1 freq able (1) - 436 freq gable (1) - 8 freq -able (1) - 1 freq falls (2) - 15 freq tabie (2) - 1 freq fal (2) - 4 freq saule (2) - 2 freq failt (2) - 7 freq hanle (2) - 4 freq farls (2) - 5 freq aple (2) - 2 freq fankle (2) - 45 freq galle (2) - 1 freq unable (2) - 19 freq viable (2) - 11 freq carle (2) - 8 freq |
fable (0) - 8 freq feable (1) - 1 freq gable (2) - 8 freq feeble (2) - 10 freq fables (2) - 10 freq -able (2) - 1 freq able (2) - 436 freq yable (2) - 7 freq mable (2) - 2 freq sable (2) - 2 freq cable (2) - 12 freq fabled (2) - 3 freq table (2) - 686 freq ible (3) - 1 freq falloe (3) - 1 freq foyle (3) - 1 freq fabio (3) - 1 freq pablo (3) - 2 freq farl (3) - 5 freq fabby (3) - 68 freq ablo (3) - 135 freq fumble (3) - 1 freq gablo (3) - 1 freq aible (3) - 2 freq fabbie (3) - 2 freq |
SoundEx code - F140 feeble - 10 freq feebly - 6 freq fable - 8 freq fuffle - 1 freq feable - 1 freq fuffily - 1 freq fufil - 2 freq 'feeble - 1 freq fuffle - 1 freq fooball - 1 freq |
MetaPhone code - FBL feeble - 10 freq feebly - 6 freq fable - 8 freq feable - 1 freq viable - 11 freq 'feeble - 1 freq fooball - 1 freq |
FABLE |
| Time to execute Levenshtein function - 0.199150 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.397863 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.029106 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.038805 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.000868 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. |