| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faisible (0) - 3 freq risible (2) - 1 freq visible (2) - 25 freq veisible (2) - 1 freq feasible (2) - 2 freq ansible (2) - 2 freq fairisle (2) - 2 freq yaisable (2) - 1 freq fable (3) - 8 freq invisible (3) - 44 freq faimily (3) - 189 freq flexible (3) - 7 freq possible (3) - 179 freq sinsible (3) - 1 freq maistile (3) - 1 freq aisily (3) - 1 freq maisie (3) - 242 freq caistle (3) - 4 freq visibly (3) - 9 freq facsimile (3) - 2 freq plausible (3) - 2 freq facile (3) - 2 freq sensible (3) - 34 freq aible (3) - 2 freq paesable (3) - 1 freq |
faisible (0) - 3 freq feasible (2) - 2 freq yaisable (3) - 1 freq visible (3) - 25 freq ansible (3) - 2 freq veisible (3) - 1 freq risible (3) - 1 freq fixable (4) - 1 freq fasil (4) - 1 freq visable (4) - 1 freq friable (4) - 2 freq visibly (4) - 9 freq fissile (4) - 1 freq fissle (4) - 3 freq fable (4) - 8 freq fairisle (4) - 2 freq veesible (4) - 4 freq paesable (4) - 1 freq poasible (4) - 1 freq disable (4) - 1 freq maisiel (5) - 1 freq eligible (5) - 4 freq aisle (5) - 27 freq frisbee (5) - 4 freq fausely (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 |
FAISIBLE |
| Time to execute Levenshtein function - 0.215295 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.541279 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.074513 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.037610 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.000872 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. |