| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rerun (0) - 1 freq retrun (1) - 1 freq erun (1) - 2 freq reruns (1) - 1 freq re-run (1) - 1 freq eeran (2) - 2 freq seun (2) - 10 freq re-runs (2) - 1 freq remin (2) - 1 freq rxruc (2) - 1 freq return (2) - 132 freq regan (2) - 1 freq rrus (2) - 1 freq rwran (2) - 1 freq reuu (2) - 1 freq reut (2) - 1 freq rerr (2) - 21 freq begun (2) - 79 freq tern (2) - 1 freq wern (2) - 1 freq rein (2) - 14 freq eerin (2) - 2 freq rehung (2) - 1 freq redup (2) - 1 freq deun (2) - 31 freq |
rerun (0) - 1 freq rearan (2) - 1 freq rearin (2) - 8 freq re-run (2) - 1 freq rarin (2) - 5 freq reruns (2) - 1 freq retrun (2) - 1 freq erun (2) - 2 freq dern (3) - 21 freq kern (3) - 3 freq reign (3) - 15 freq 'run (3) - 1 freq roarin (3) - 60 freq redin (3) - 2 freq roaran (3) - 4 freq erin (3) - 9 freq arun (3) - 2 freq orun (3) - 1 freq roaren (3) - 6 freq weren (3) - 2 freq reken (3) - 1 freq fern (3) - 5 freq bern (3) - 10 freq ren (3) - 11 freq cern (3) - 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 |
RERUN |
| Time to execute Levenshtein function - 0.394535 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.874982 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.031721 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.085781 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.001059 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. |