| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fabulous (0) - 9 freq nebulous (2) - 2 freq faumous (2) - 3 freq faamous (3) - 1 freq fautors (3) - 1 freq faulds (3) - 21 freq fabils (3) - 2 freq parlous (3) - 1 freq raucous (3) - 8 freq callous (3) - 2 freq famous (3) - 105 freq fashious (3) - 20 freq garrulous (3) - 1 freq gallous (3) - 1 freq faults (3) - 3 freq allous (3) - 27 freq fables (3) - 10 freq vacuous (3) - 2 freq populous (3) - 1 freq fauls (3) - 2 freq aqueous (3) - 1 freq fawmous (3) - 10 freq fallout (3) - 1 freq cumulous (3) - 1 freq jailous (3) - 1 freq |
fabulous (0) - 9 freq nebulous (3) - 2 freq fabils (3) - 2 freq fables (3) - 10 freq gablos (4) - 1 freq fabius (4) - 2 freq fauls (4) - 2 freq faumous (4) - 3 freq cabals (5) - 4 freq faalls (5) - 1 freq falls (5) - 15 freq folloos (5) - 1 freq fouls (5) - 2 freq nables (5) - 1 freq feuls (5) - 1 freq foulis (5) - 1 freq cables (5) - 6 freq rabels (5) - 1 freq foibles (5) - 2 freq fals (5) - 1 freq fallaes (5) - 1 freq fabled (5) - 3 freq floes (5) - 1 freq gables (5) - 4 freq buls (5) - 1 freq |
SoundEx code - F142 fables - 10 freq feefles - 1 freq foibles - 2 freq fabulous - 9 freq foveoles - 1 freq fuffie-like - 2 freq fabils - 2 freq fufills - 1 freq fifelike - 3 freq |
MetaPhone code - FBLS fables - 10 freq foibles - 2 freq fabulous - 9 freq fabils - 2 freq |
FABULOUS |
| Time to execute Levenshtein function - 0.200418 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.361989 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.027607 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.037856 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.000908 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. |