| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rippling (0) - 1 freq ripplin (1) - 12 freq ripping (1) - 1 freq rippin (2) - 21 freq toppling (2) - 1 freq ripplan (2) - 2 freq dipping (2) - 3 freq cripplin (2) - 3 freq ripplit (2) - 1 freq tipplin (2) - 1 freq rimplin (2) - 1 freq kipling (2) - 3 freq nipping (2) - 11 freq dripping (2) - 2 freq rippin' (2) - 1 freq sipping (2) - 1 freq tripping (2) - 3 freq kipplin (2) - 1 freq tipping (2) - 3 freq repping (2) - 1 freq cupping (3) - 1 freq propping (3) - 1 freq rippled (3) - 1 freq rolling (3) - 7 freq filling (3) - 5 freq |
rippling (0) - 1 freq ripping (2) - 1 freq ripplin (2) - 12 freq repping (3) - 1 freq ripplan (3) - 2 freq toppling (3) - 1 freq rippin' (4) - 1 freq kipplin (4) - 1 freq sipping (4) - 1 freq replying (4) - 3 freq applying (4) - 8 freq dripping (4) - 2 freq tipping (4) - 3 freq tripping (4) - 3 freq ripplit (4) - 1 freq nipping (4) - 11 freq dipping (4) - 3 freq tipplin (4) - 1 freq cripplin (4) - 3 freq kipling (4) - 3 freq rippin (4) - 21 freq rimplin (4) - 1 freq dumpling (5) - 3 freq popping (5) - 1 freq topping (5) - 2 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 - RPLNK rippling - 1 freq |
RIPPLING |
| Time to execute Levenshtein function - 0.383367 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.674031 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.030837 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.049970 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.000924 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. |