| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| replenish (0) - 1 freq replenisht (1) - 1 freq plenish (2) - 6 freq replenished (2) - 2 freq revenish (2) - 1 freq replenishit (2) - 1 freq replenishin (2) - 3 freq feenish (3) - 106 freq reemish (3) - 1 freq lenish (3) - 1 freq relish (3) - 7 freq repents (3) - 2 freq plenisht (3) - 4 freq relents (3) - 3 freq reprise (4) - 1 freq repented (4) - 1 freq mcleish (4) - 5 freq callanish (4) - 1 freq replaces (4) - 1 freq reponit (4) - 8 freq reponents (4) - 1 freq reprent (4) - 2 freq reddish (4) - 1 freq replacit (4) - 1 freq röenis (4) - 1 freq |
replenish (0) - 1 freq replenisht (2) - 1 freq replenishit (3) - 1 freq plenish (3) - 6 freq replenishin (3) - 3 freq replenished (3) - 2 freq revenish (4) - 1 freq lenish (5) - 1 freq plenisht (5) - 4 freq relish (5) - 7 freq replantit (6) - 1 freq plenished (6) - 1 freq plenishes (6) - 6 freq punish (6) - 4 freq repones (6) - 59 freq splesh (6) - 2 freq ripeness (6) - 1 freq repons (6) - 1 freq plens (6) - 17 freq spainish (6) - 3 freq reply's (6) - 6 freq replies (6) - 78 freq reponse (6) - 1 freq spanish (6) - 41 freq ripens (6) - 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 - RPLNX replenish - 1 freq |
REPLENISH |
| Time to execute Levenshtein function - 0.217084 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.375814 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.028019 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.038914 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.000898 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. |