| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retro-font (0) - 1 freq retrospect (4) - 1 freq recoont (4) - 3 freq near-front (4) - 1 freq retirement (5) - 17 freq reid-hot (5) - 1 freq ferr-kent (5) - 7 freq two-tone (5) - 1 freq awtroon (5) - 26 freq represent (5) - 29 freq restraint (5) - 5 freq reed-hot (5) - 1 freq hert-felt (5) - 1 freq recoonts (5) - 2 freq cerry-oot (5) - 1 freq retrograwd (5) - 1 freq droont (5) - 30 freq rearmament (5) - 1 freq reid-hoat (5) - 1 freq zero-hour (5) - 1 freq propont (5) - 1 freq kerry-oot (5) - 1 freq croont (5) - 5 freq retrunit (5) - 1 freq retortit (5) - 2 freq |
retro-font (0) - 1 freq aert-fast (7) - 2 freq returnt (7) - 16 freq retrunit (7) - 1 freq aert-kent (7) - 1 freq retuirnt (7) - 3 freq reteirment (7) - 1 freq retrospect (7) - 1 freq near-front (7) - 1 freq retirement (7) - 17 freq retort (8) - 3 freq retrain (8) - 2 freq re-fit (8) - 1 freq retreating (8) - 1 freq extra-long (8) - 1 freq retreat't (8) - 1 freq retreatit (8) - 7 freq reprent (8) - 2 freq ten-foot (8) - 2 freq retrievin (8) - 1 freq refraint (8) - 1 freq retouring (8) - 1 freq tropfen (8) - 1 freq retreat (8) - 26 freq retrun (8) - 1 freq |
SoundEx code - R361 retribution - 9 freq retrieve - 7 freq rutherford - 4 freq redrafted - 1 freq retrieves - 1 freq retribution's - 1 freq retributioun - 1 freq redrob - 1 freq retro-font - 1 freq retrieved - 3 freq reid-robed - 1 freq retrievin - 1 freq roadtrip - 1 freq retriever - 2 freq raithrovers - 2 freq retrofootballnw - 1 freq |
MetaPhone code - RTRFNT retro-font - 1 freq |
RETRO-FONT |
| Time to execute Levenshtein function - 0.194027 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.365541 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.028126 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.039894 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.000909 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. |