| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| re-run (0) - 1 freq rerun (1) - 1 freq retrun (1) - 1 freq re-runs (1) - 1 freq rearin (2) - 8 freq egrun (2) - 1 freq rearan (2) - 1 freq re-cut (2) - 1 freq reruns (2) - 1 freq reboun (2) - 1 freq erun (2) - 2 freq rescue (3) - 41 freq sorun (3) - 1 freq agrun (3) - 1 freq gerrup (3) - 1 freq rennen (3) - 2 freq recon (3) - 1 freq reinen (3) - 1 freq refarin (3) - 1 freq reut (3) - 1 freq herin (3) - 2 freq rrus (3) - 1 freq renn (3) - 9 freq weirin (3) - 58 freq re'r (3) - 1 freq |
re-run (0) - 1 freq re-runs (2) - 1 freq rerun (2) - 1 freq retrun (2) - 1 freq rearan (3) - 1 freq rearin (3) - 8 freq rewirin (4) - 1 freq reborn (4) - 7 freq erran (4) - 3 freq rwran (4) - 1 freq rairin (4) - 22 freq rarin (4) - 5 freq re-org (4) - 1 freq re-born (4) - 1 freq return (4) - 132 freq ower-run (4) - 2 freq referin (4) - 1 freq errin (4) - 1 freq roaran (4) - 4 freq roarin (4) - 60 freq retirin (4) - 10 freq refrain (4) - 13 freq retrain (4) - 2 freq roaren (4) - 6 freq reruns (4) - 1 freq |
SoundEx code - R650 rairin - 22 freq roarin - 60 freq rearin - 8 freq rarin - 5 freq roaran - 4 freq roarin' - 6 freq rewirin - 1 freq rewirin' - 1 freq roaren - 6 freq 'roarin - 2 freq rearan - 1 freq 'rairin - 1 freq rear-enn - 1 freq re-run - 1 freq rerun - 1 freq rwran - 1 freq |
MetaPhone code - RRN rairin - 22 freq roarin - 60 freq rearin - 8 freq rarin - 5 freq roaran - 4 freq roarin' - 6 freq roaren - 6 freq 'roarin - 2 freq rearan - 1 freq 'rairin - 1 freq rear-enn - 1 freq re-run - 1 freq rerun - 1 freq rwran - 1 freq |
RE-RUN |
| Time to execute Levenshtein function - 0.792280 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 - 1.407783 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.102021 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.107871 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.001240 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. |