| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rihcpl (0) - 1 freq rih (3) - 1 freq ripf (3) - 1 freq micp (3) - 1 freq rihaku (3) - 2 freq ricky (3) - 7 freq richt (3) - 4119 freq riel (3) - 1 freq rhc (3) - 1 freq rikkil (3) - 3 freq nicol (3) - 19 freq ric (3) - 10 freq rinnal (3) - 1 freq rascal (3) - 5 freq ricks (3) - 1 freq rice (3) - 108 freq rich (3) - 192 freq yircel (3) - 2 freq ritual (3) - 15 freq pincil (3) - 22 freq incel (3) - 1 freq riddil (3) - 1 freq incl (3) - 3 freq rival (3) - 14 freq ricey (3) - 1 freq |
rihcpl (0) - 1 freq rickly (5) - 1 freq recl (5) - 1 freq yircel (5) - 2 freq richual (5) - 1 freq ripple (5) - 7 freq richly (5) - 4 freq rickle (5) - 31 freq rascal (5) - 5 freq rhc (5) - 1 freq principle (6) - 27 freq ruchly (6) - 3 freq chicl (6) - 1 freq ruckle (6) - 2 freq radical (6) - 63 freq principal (6) - 21 freq hirple (6) - 12 freq ricklie (6) - 10 freq raachil (6) - 10 freq chapel (6) - 37 freq repel (6) - 2 freq disciple (6) - 6 freq cpyl (6) - 1 freq recall (6) - 11 freq vehicul (6) - 1 freq |
SoundEx code - R214 reek-bleckened - 1 freq rockpools - 1 freq resplendent - 4 freq re-spell - 1 freq risible - 1 freq respellin - 1 freq roosevelt - 1 freq re-shuffle - 2 freq rrjvalentine - 1 freq rihcpl - 1 freq roezvlrkac - 1 freq |
MetaPhone code - RKPL rihcpl - 1 freq |
RIHCPL |
| Time to execute Levenshtein function - 0.528523 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.878896 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.083864 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.095443 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.001222 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. |