| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foibles (0) - 2 freq hobbles (2) - 2 freq forbyes (2) - 6 freq roubles (2) - 1 freq cobles (2) - 2 freq oiles (2) - 1 freq paibles (2) - 1 freq nobles (2) - 7 freq bibles (2) - 6 freq fumbles (2) - 2 freq files (2) - 108 freq fibres (2) - 2 freq doubles (2) - 11 freq doobles (2) - 2 freq fables (2) - 10 freq bobbles (2) - 1 freq cobbles (2) - 10 freq forbes (2) - 10 freq bible (3) - 93 freq focuses (3) - 2 freq foulest (3) - 1 freq folks (3) - 110 freq toiled (3) - 2 freq fyles (3) - 44 freq boles (3) - 1 freq |
foibles (0) - 2 freq fables (2) - 10 freq fumbles (3) - 2 freq files (3) - 108 freq doubles (3) - 11 freq bibles (3) - 6 freq fibres (3) - 2 freq doobles (3) - 2 freq nobles (3) - 7 freq roubles (3) - 1 freq cobles (3) - 2 freq paibles (3) - 1 freq tables (4) - 83 freq females (4) - 9 freq faimiles (4) - 2 freq folies (4) - 1 freq fiels (4) - 23 freq nables (4) - 1 freq fable (4) - 8 freq foalies (4) - 1 freq fabled (4) - 3 freq feefles (4) - 1 freq fowls (4) - 1 freq enables (4) - 1 freq faimlies (4) - 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 |
FOIBLES |
| Time to execute Levenshtein function - 0.484567 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.803273 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.029037 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.091800 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.000770 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. |