| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retailers (0) - 3 freq retailer (1) - 1 freq retailed (2) - 1 freq retails (2) - 1 freq retail (3) - 7 freq reevlers (3) - 4 freq reapers (3) - 2 freq repairs (3) - 6 freq retains (3) - 4 freq tailors (3) - 7 freq settlers (3) - 11 freq taivers (3) - 3 freq recuivers (3) - 1 freq readers (3) - 87 freq eilers (3) - 1 freq reciters (3) - 1 freq eraiters (3) - 2 freq retained (3) - 2 freq resiles (3) - 1 freq raiders (3) - 4 freq reivers (3) - 17 freq jailers (3) - 1 freq detailed (3) - 15 freq details (3) - 70 freq dailers (3) - 2 freq |
retailers (0) - 3 freq retailer (2) - 1 freq retails (3) - 1 freq tailors (4) - 7 freq reevlers (4) - 4 freq eraiters (4) - 2 freq retailed (4) - 1 freq ritirs (5) - 1 freq rowlers (5) - 3 freq antlers (5) - 11 freq taylors (5) - 1 freq trailers (5) - 1 freq dealers (5) - 10 freq reuters (5) - 6 freq rollers (5) - 5 freq retells (5) - 1 freq teylers (5) - 1 freq rulers (5) - 8 freq retours (5) - 4 freq ootliers (5) - 1 freq dailers (5) - 2 freq tylers (5) - 1 freq regulars (5) - 16 freq retaliates (5) - 2 freq eraiturs (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.189710 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.380728 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.028394 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.037840 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.000859 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. |