| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retailers (0) - 3 freq retailer (1) - 1 freq retailed (2) - 1 freq retails (2) - 1 freq recuivers (3) - 1 freq reevlers (3) - 4 freq tailors (3) - 7 freq reapers (3) - 2 freq mailers (3) - 1 freq jailers (3) - 1 freq eraiters (3) - 2 freq retained (3) - 2 freq dailers (3) - 2 freq readers (3) - 88 freq detailed (3) - 14 freq settlers (3) - 11 freq repairs (3) - 6 freq resiles (3) - 1 freq reciters (3) - 1 freq revellers (3) - 1 freq reivers (3) - 17 freq details (3) - 70 freq taivers (3) - 3 freq trailers (3) - 1 freq retains (3) - 4 freq |
retailers (0) - 3 freq retailer (2) - 1 freq retails (3) - 1 freq retailed (4) - 1 freq tailors (4) - 7 freq reevlers (4) - 4 freq eraiters (4) - 2 freq eraiturs (5) - 1 freq rowlers (5) - 3 freq rollers (5) - 6 freq eilers (5) - 1 freq dealers (5) - 10 freq ootliers (5) - 1 freq raiders (5) - 5 freq retail (5) - 7 freq reuters (5) - 6 freq retaliates (5) - 2 freq taylors (5) - 1 freq teylers (5) - 1 freq tylers (5) - 1 freq retains (5) - 4 freq regulars (5) - 16 freq rulers (5) - 8 freq antlers (5) - 11 freq ritirs (5) - 1 freq |
SoundEx code - R346 rottweilers - 1 freq 'rottweiler - 1 freq rottweiler - 1 freq retailers - 3 freq radioleary - 5 freq retailer - 1 freq |
MetaPhone code - RTLRS retailers - 3 freq |
RETAILERS |
| Time to execute Levenshtein function - 0.241142 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.370169 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.027802 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.039790 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.001113 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. |