| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retail (0) - 7 freq retain (1) - 8 freq detail (1) - 42 freq retails (1) - 1 freq ketil (2) - 7 freq ettil (2) - 20 freq metall (2) - 3 freq oxtail (2) - 1 freq uptail (2) - 2 freq relait (2) - 1 freq rail (2) - 29 freq email (2) - 50 freq methil (2) - 1 freq remain (2) - 39 freq recall (2) - 10 freq prevail (2) - 10 freq retailer (2) - 1 freq rattil (2) - 1 freq regal (2) - 2 freq resaif (2) - 2 freq retard (2) - 2 freq entail (2) - 3 freq fettil (2) - 2 freq detailt (2) - 2 freq real (2) - 565 freq |
retail (0) - 7 freq retain (2) - 8 freq retails (2) - 1 freq detail (2) - 42 freq retailed (3) - 1 freq rettie (3) - 1 freq reuril (3) - 1 freq entail (3) - 3 freq rental (3) - 9 freq real (3) - 565 freq petal (3) - 10 freq ritual (3) - 13 freq rtl (3) - 1 freq metal (3) - 90 freq regal (3) - 2 freq retir (3) - 1 freq recoil (3) - 3 freq tail (3) - 263 freq uptail (3) - 2 freq ettil (3) - 20 freq ketil (3) - 7 freq rail (3) - 29 freq rattil (3) - 1 freq retailer (3) - 1 freq oxtail (3) - 1 freq |
SoundEx code - R340 rat-hole - 3 freq riddle - 32 freq rattle - 36 freq ritual - 13 freq rudely - 3 freq ritually - 2 freq rettle - 1 freq readily - 7 freq rïddle - 1 freq ridley - 2 freq rat-hol - 1 freq retail - 7 freq rattoal - 1 freq rat-holl - 1 freq rattil - 1 freq riddil - 1 freq rtl - 1 freq rdhale - 3 freq |
MetaPhone code - RTL riddle - 32 freq rattle - 36 freq ritual - 13 freq rudely - 3 freq ritually - 2 freq rettle - 1 freq readily - 7 freq rïddle - 1 freq ridley - 2 freq retail - 7 freq rattoal - 1 freq rattil - 1 freq riddil - 1 freq rtl - 1 freq |
RETAIL |
| Time to execute Levenshtein function - 0.192853 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.391348 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.027486 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.037095 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.000865 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. |