| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repost (0) - 1 freq report (1) - 224 freq repast (1) - 1 freq resist (2) - 45 freq depot (2) - 1 freq freepost (2) - 2 freq s'post (2) - 8 freq repas (2) - 1 freq revolt (2) - 3 freq repoort (2) - 1 freq reist (2) - 8 freq repaet (2) - 1 freq reporte (2) - 1 freq reponse (2) - 1 freq raport (2) - 1 freq reest (2) - 11 freq repond (2) - 1 freq ripest (2) - 1 freq rest (2) - 683 freq repeat (2) - 77 freq repent (2) - 17 freq depose (2) - 1 freq repone (2) - 68 freq repon (2) - 8 freq reps (2) - 1 freq |
repost (0) - 1 freq repast (1) - 1 freq report (2) - 224 freq ripest (2) - 1 freq repent (3) - 17 freq repeat (3) - 77 freq rest (3) - 683 freq reps (3) - 1 freq repint (3) - 3 freq rost (3) - 4 freq roost (3) - 41 freq reest (3) - 11 freq reponit (3) - 8 freq deposit (3) - 5 freq post (3) - 224 freq raport (3) - 1 freq repas (3) - 1 freq resist (3) - 45 freq freepost (3) - 2 freq reist (3) - 8 freq repoort (3) - 1 freq repaet (3) - 1 freq reporte (3) - 1 freq erst (4) - 5 freq request (4) - 28 freq |
SoundEx code - R123 repositorie - 1 freq refused - 40 freq repost - 1 freq robust - 10 freq ravaged - 2 freq refusit - 6 freq revokit - 1 freq rhapsody - 1 freq refuised - 1 freq reveesitin - 1 freq repast - 1 freq rebukit - 3 freq reveesit - 1 freq rebiggit - 2 freq revisitit - 1 freq refected - 1 freq reveisitit - 1 freq reveisit - 1 freq refaised - 1 freq ripest - 1 freq re-biggit - 2 freq refectory - 1 freq revised - 2 freq re-passed - 1 freq reposeetion - 1 freq revisit - 3 freq revsitied - 1 freq revstu - 1 freq rfjtdh - 1 freq refyoozed - 1 freq raiphsadventcalandur - 1 freq rpxjzttv - 2 freq |
MetaPhone code - RPST repost - 1 freq repast - 1 freq ripest - 1 freq re-passed - 1 freq |
REPOST |
| Time to execute Levenshtein function - 0.204908 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.384061 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.028004 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.043186 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.000852 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. |