| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fiddlers (0) - 9 freq fiddlers' (1) - 1 freq fiddler (1) - 24 freq fiddles (1) - 18 freq fiddler's (1) - 9 freq idders (2) - 40 freq fiddiles (2) - 1 freq middler's (2) - 1 freq riddles (2) - 9 freq fillers (2) - 1 freq tiddles (2) - 8 freq meddlers (2) - 1 freq fiddled (2) - 1 freq fiddies (2) - 1 freq piddles (2) - 4 freq fiddle (2) - 65 freq caddlers (2) - 1 freq finders (2) - 2 freq tiddler (2) - 2 freq fadders (2) - 3 freq toddlers (2) - 3 freq kindlers (2) - 1 freq middles (2) - 1 freq midders (2) - 8 freq idlers (2) - 1 freq |
fiddlers (0) - 9 freq fiddles (2) - 18 freq fiddler's (2) - 9 freq fiddlers' (2) - 1 freq fiddler (2) - 24 freq muddlers (3) - 1 freq toddlers (3) - 3 freq meddlers (3) - 1 freq caddlers (3) - 1 freq fedders (3) - 21 freq fiddiles (3) - 1 freq fadders (3) - 3 freq kindlers (4) - 1 freq toddlurs (4) - 1 freq middles (4) - 1 freq midders (4) - 8 freq fiedles (4) - 2 freq fidder (4) - 12 freq widders (4) - 2 freq idlers (4) - 1 freq fillers (4) - 1 freq tiddles (4) - 8 freq middler's (4) - 1 freq tiddler (4) - 2 freq idders (4) - 40 freq |
SoundEx code - F346 fiddler - 24 freq fetlar - 9 freq fiddler's - 9 freq fiddlers - 9 freq faith-haelers - 1 freq fidhlear - 1 freq fitehillers - 2 freq fiddlers' - 1 freq |
MetaPhone code - FTLRS fiddler's - 9 freq fiddlers - 9 freq fiddlers' - 1 freq |
FIDDLERS |
| Time to execute Levenshtein function - 0.211214 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.363088 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.028938 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.043755 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.000938 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. |