| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ruffling (0) - 1 freq reffing (2) - 1 freq puffing (2) - 2 freq baffling (2) - 1 freq mufflin (2) - 2 freq rumbling (2) - 1 freq jufflin (2) - 1 freq ruling (2) - 1 freq ruckling (2) - 1 freq shuffling (2) - 1 freq ruffin (2) - 2 freq rumiling (2) - 1 freq offing (3) - 1 freq fumbling (3) - 2 freq filing (3) - 1 freq refusing (3) - 5 freq cuddling (3) - 1 freq bubbling (3) - 1 freq wafflin (3) - 2 freq mumbling (3) - 1 freq ruffles (3) - 1 freq pulling (3) - 11 freq suffrin (3) - 1 freq curling (3) - 3 freq rumblin (3) - 12 freq |
ruffling (0) - 1 freq baffling (3) - 1 freq reffing (3) - 1 freq ruckling (4) - 1 freq ruffin (4) - 2 freq ruling (4) - 1 freq rumiling (4) - 1 freq shuffling (4) - 1 freq jufflin (4) - 1 freq mufflin (4) - 2 freq puffing (4) - 2 freq rumbling (4) - 1 freq rambling (5) - 3 freq ruffled (5) - 4 freq hafflins (5) - 1 freq rolling (5) - 7 freq affline (5) - 2 freq offline (5) - 1 freq guffawing (5) - 1 freq wafflin' (5) - 1 freq rippling (5) - 1 freq riflin (5) - 1 freq fling (5) - 83 freq haufling (5) - 1 freq snaffling (5) - 1 freq |
SoundEx code - R145 ripplin - 12 freq revealin - 14 freq revellin - 3 freq raivelment - 3 freq raivlin - 1 freq riflin - 1 freq rebellion - 36 freq rebellion's - 2 freq replenished - 2 freq ruffling - 1 freq raiblin - 1 freq raivelin - 2 freq replantit - 1 freq ripplan - 2 freq æriplenns - 1 freq ravelings - 1 freq rivlins - 2 freq rivlin - 5 freq rivlin-strings - 1 freq replyin - 9 freq replying - 3 freq raivellin - 1 freq revealing - 2 freq rippling - 1 freq replenishit - 1 freq ravelin - 3 freq ravelins - 1 freq replayin - 1 freq replenishin - 3 freq replenisht - 1 freq re-plooin - 1 freq repellin - 2 freq replenish - 1 freq reevlan - 2 freq repellent - 1 freq refillin - 1 freq revealin' - 1 freq rablennox - 17 freq rebalancing - 1 freq |
MetaPhone code - RFLNK ruffling - 1 freq revealing - 2 freq |
RUFFLING |
| Time to execute Levenshtein function - 0.215549 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.376226 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.033285 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.037949 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.000884 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. |