| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fabulous (0) - 9 freq nebulous (2) - 2 freq faumous (2) - 3 freq fables (3) - 10 freq cumulous (3) - 1 freq populous (3) - 1 freq jalous (3) - 1 freq parlous (3) - 1 freq fauvour (3) - 3 freq vacuous (3) - 1 freq faamous (3) - 1 freq fallows (3) - 1 freq garrulous (3) - 1 freq famous (3) - 97 freq fawmous (3) - 10 freq aqueous (3) - 1 freq faulds (3) - 20 freq fabils (3) - 2 freq jaelous (3) - 2 freq fashious (3) - 20 freq fauls (3) - 2 freq bulbous (3) - 2 freq callous (3) - 2 freq fabius (3) - 2 freq fautors (3) - 1 freq |
fabulous (0) - 9 freq fables (3) - 10 freq fabils (3) - 2 freq nebulous (3) - 2 freq faumous (4) - 3 freq fabius (4) - 2 freq gablos (4) - 1 freq fauls (4) - 2 freq fouls (5) - 2 freq fable (5) - 8 freq buls (5) - 1 freq fallaes (5) - 1 freq fails (5) - 20 freq fals (5) - 1 freq faals (5) - 1 freq faalls (5) - 1 freq families (5) - 30 freq labels (5) - 6 freq baloos (5) - 1 freq folloos (5) - 1 freq faels (5) - 1 freq falls (5) - 15 freq blois (5) - 5 freq floes (5) - 1 freq faimlies (5) - 47 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.176237 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.324410 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.026875 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.036710 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.000825 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. |