| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fiddler (0) - 24 freq fiddle (1) - 65 freq fidder (1) - 12 freq fiddled (1) - 1 freq tiddler (1) - 2 freq fiddles (1) - 18 freq fiddlers (1) - 9 freq riddles (2) - 9 freq hiddlet (2) - 1 freq filler (2) - 2 freq toddler (2) - 2 freq paddler (2) - 2 freq riddle (2) - 32 freq tiddle (2) - 1 freq fiddiles (2) - 1 freq diddle (2) - 14 freq nidder (2) - 6 freq fiddler's (2) - 9 freq diddled (2) - 2 freq fidhlear (2) - 1 freq middles (2) - 1 freq piddled (2) - 1 freq idder (2) - 286 freq piddles (2) - 4 freq midder (2) - 64 freq |
fiddler (0) - 24 freq fiddles (2) - 18 freq tiddler (2) - 2 freq fiddlers (2) - 9 freq fiddle (2) - 65 freq fidder (2) - 12 freq fiddled (2) - 1 freq fidhlear (3) - 1 freq fiddlin (3) - 5 freq fadder (3) - 69 freq cuddler (3) - 1 freq fiddiles (3) - 1 freq fuddled (3) - 1 freq fodder (3) - 9 freq fiddly (3) - 1 freq toddler (3) - 2 freq paddler (3) - 2 freq fedder (3) - 36 freq piddle (4) - 3 freq fiddil (4) - 2 freq middle (4) - 498 freq aidder (4) - 1 freq bidder (4) - 1 freq riddled (4) - 7 freq finder (4) - 5 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 - FTLR fiddler - 24 freq fetlar - 9 freq vadlure - 6 freq fidhlear - 1 freq |
FIDDLER |
| Time to execute Levenshtein function - 0.169582 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.324972 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.027519 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.037902 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. |