| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fufidius (0) - 2 freq aufidus (2) - 1 freq ummidius (3) - 2 freq wuidins (3) - 1 freq fifities (3) - 1 freq fufills (3) - 1 freq fuids (3) - 2 freq rufillus (3) - 1 freq fundins (3) - 1 freq fundies (3) - 13 freq furious (3) - 12 freq guidis (3) - 1 freq guidins (3) - 1 freq feidin (4) - 1 freq fundin (4) - 62 freq fundiet (4) - 1 freq wuidie (4) - 2 freq hurdies (4) - 27 freq fufil (4) - 2 freq ruinous (4) - 1 freq cupids (4) - 1 freq wuidin (4) - 24 freq findins (4) - 4 freq rufus (4) - 5 freq wuidid (4) - 1 freq |
fufidius (0) - 2 freq aufidus (3) - 1 freq fifities (4) - 1 freq fundies (4) - 13 freq fuids (4) - 2 freq fifie's (5) - 1 freq fifties (5) - 21 freq flids (5) - 1 freq fiddies (5) - 1 freq fluids (5) - 8 freq fridays (5) - 11 freq fuds (5) - 8 freq funds (5) - 23 freq furious (5) - 12 freq fundins (5) - 1 freq fufills (5) - 1 freq guidis (5) - 1 freq ummidius (5) - 2 freq faffs (6) - 1 freq fuffie (6) - 1 freq greedius (6) - 1 freq fords (6) - 1 freq dafities (6) - 1 freq fuffin (6) - 2 freq radius (6) - 3 freq |
SoundEx code - F132 fifties - 21 freq fobwatch - 2 freq fifths - 1 freq fifty-seiven - 1 freq 'fifty-six - 1 freq fifities - 1 freq fifty-seeven - 2 freq fifty-sax - 1 freq fufidius - 2 freq fifty-six - 1 freq fuftiesax - 2 freq |
MetaPhone code - FFTS fifties - 21 freq fights - 4 freq fifities - 1 freq fufidius - 2 freq feghts - 1 freq |
FUFIDIUS |
| Time to execute Levenshtein function - 0.502215 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.734776 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.085306 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.096835 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.001101 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. |