| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feasibility (0) - 6 freq veesibility (2) - 1 freq possibility (3) - 17 freq flexibility (3) - 3 freq veisbility (3) - 1 freq plausibility (3) - 1 freq visibility (3) - 4 freq readability (3) - 1 freq viability (4) - 1 freq disability (4) - 5 freq accessibility (4) - 3 freq usability (4) - 1 freq capability (4) - 1 freq femininity (4) - 2 freq facility (4) - 9 freq sensitivity (4) - 4 freq possibeility (4) - 1 freq debility (4) - 1 freq credibility (4) - 3 freq faceility (4) - 1 freq fraility (4) - 1 freq inability (4) - 5 freq ability (4) - 43 freq hability (4) - 2 freq liability (4) - 5 freq |
feasibility (0) - 6 freq veesibility (3) - 1 freq visibility (4) - 4 freq veisbility (4) - 1 freq visability (5) - 2 freq feasible (5) - 1 freq usability (5) - 1 freq disability (5) - 5 freq flexibility (5) - 3 freq possibility (5) - 17 freq readability (5) - 1 freq plausibility (5) - 1 freq liability (6) - 5 freq hability (6) - 2 freq ability (6) - 43 freq possiebility (6) - 1 freq fraility (6) - 1 freq affabeility (6) - 1 freq fragility (6) - 2 freq stability (6) - 3 freq inability (6) - 5 freq viability (6) - 1 freq capability (6) - 1 freq possibeility (6) - 1 freq facility (6) - 9 freq |
SoundEx code - F214 fish-flunkey - 2 freq fush-flunkie - 2 freq fishbowl - 1 freq feasible - 1 freq faisible - 3 freq feasibility - 6 freq fixable - 1 freq |
MetaPhone code - FSBLT visibility - 4 freq visability - 2 freq feasibility - 6 freq veisbility - 1 freq veesibility - 1 freq |
FEASIBILITY |
| Time to execute Levenshtein function - 0.211599 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.353427 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.026975 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.036777 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.000783 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. |