Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ripplan (0) - 2 freq ripplin (1) - 12 freq hipplan (1) - 1 freq rippan (1) - 1 freq grippan (2) - 2 freq rippen (2) - 5 freq ripple (2) - 7 freq rippling (2) - 1 freq cripplin (2) - 3 freq ripples (2) - 8 freq rippled (2) - 1 freq lippan (2) - 1 freq rippa (2) - 4 freq kipplin (2) - 1 freq tipplin (2) - 1 freq rippin (2) - 21 freq drippan (2) - 5 freq ripplit (2) - 1 freq nippan (2) - 1 freq rimplin (2) - 1 freq tricklan (3) - 1 freq fillan (3) - 8 freq millan (3) - 1 freq airplane (3) - 4 freq trippin (3) - 33 freq |
ripplan (0) - 2 freq ripplin (1) - 12 freq rippan (2) - 1 freq hipplan (2) - 1 freq tipplin (3) - 1 freq rippin (3) - 21 freq kipplin (3) - 1 freq rimplin (3) - 1 freq ripplit (3) - 1 freq rippled (3) - 1 freq ripple (3) - 7 freq rippen (3) - 5 freq cripplin (3) - 3 freq rippling (3) - 1 freq ripples (3) - 8 freq repeoplin (4) - 2 freq papplin (4) - 2 freq grapplin (4) - 16 freq rappin (4) - 6 freq airplane (4) - 4 freq zepplin (4) - 1 freq rumplin (4) - 1 freq rippuld (4) - 1 freq grippan (4) - 2 freq drippan (4) - 5 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 - RPLN ripplin - 12 freq ripplan - 2 freq re-plooin - 1 freq repellin - 2 freq |
RIPPLAN |
Time to execute Levenshtein function - 0.223216 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.351855 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.028260 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.037154 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.000941 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. |