| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feasible (0) - 2 freq faisible (2) - 3 freq feable (2) - 1 freq sensible (2) - 34 freq poasible (2) - 1 freq veisible (2) - 1 freq veesible (2) - 4 freq fearie (3) - 2 freq fertile (3) - 22 freq terrible (3) - 136 freq fable (3) - 8 freq fasil (3) - 1 freq peasie (3) - 1 freq faside (3) - 1 freq possible (3) - 179 freq ansible (3) - 2 freq feastie (3) - 1 freq seaside (3) - 10 freq easily (3) - 60 freq flexible (3) - 7 freq resile (3) - 1 freq sinsible (3) - 1 freq legible (3) - 3 freq edible (3) - 3 freq dwaible (3) - 2 freq |
feasible (0) - 2 freq faisible (2) - 3 freq veesible (3) - 4 freq poasible (3) - 1 freq veisible (3) - 1 freq feable (3) - 1 freq fissile (4) - 1 freq ansible (4) - 2 freq visible (4) - 25 freq fasil (4) - 1 freq risible (4) - 1 freq fable (4) - 8 freq feeble (4) - 10 freq sensible (4) - 34 freq visibly (5) - 9 freq yaisable (5) - 1 freq paesable (5) - 1 freq fumble (5) - 1 freq taible (5) - 2 freq disable (5) - 1 freq facile (5) - 2 freq easle (5) - 2 freq friable (5) - 2 freq feasibility (5) - 6 freq affable (5) - 1 freq |
SoundEx code - F214 fish-flunkey - 2 freq fush-flunkie - 2 freq feasible - 2 freq fishbowl - 1 freq faisible - 3 freq feasibility - 6 freq fixable - 1 freq |
MetaPhone code - FSBL visible - 25 freq visibly - 9 freq feasible - 2 freq veesible - 4 freq faisible - 3 freq vizzie-bell - 1 freq visable - 1 freq veisible - 1 freq |
FEASIBLE |
| Time to execute Levenshtein function - 0.366435 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.815429 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.077643 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.084321 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.006888 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. |