| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rerek (0) - 1 freq derek (1) - 40 freq reek (1) - 167 freq erek (1) - 1 freq yerk (2) - 3 freq reer (2) - 1 freq rede (2) - 14 freq week (2) - 637 freq rare (2) - 301 freq reck (2) - 20 freq 'brek (2) - 1 freq neek (2) - 1 freq redrew (2) - 1 freq reik (2) - 15 freq reef (2) - 59 freq mere (2) - 24 freq rees (2) - 6 freq reyk (2) - 1 freq riek (2) - 2 freq yere (2) - 7 freq reeks (2) - 7 freq reet (2) - 8 freq beek (2) - 64 freq reed (2) - 184 freq deek (2) - 44 freq |
rerek (0) - 1 freq erek (2) - 1 freq reek (2) - 167 freq derek (2) - 40 freq serk (3) - 3 freq resk (3) - 1 freq remerk (3) - 3 freq direk (3) - 2 freq jerk (3) - 8 freq rer (3) - 3 freq rarer (3) - 8 freq brek (3) - 131 freq uerk (3) - 1 freq verk (3) - 2 freq merk (3) - 63 freq berk (3) - 3 freq remak (3) - 1 freq derk (3) - 106 freq breek (3) - 3 freq rek (3) - 2 freq rared (3) - 2 freq raek (3) - 1 freq rerr (3) - 21 freq reeky (3) - 4 freq perk (3) - 28 freq |
SoundEx code - R620 roars - 23 freq rairs - 3 freq rears - 2 freq rehearse - 4 freq roar's - 19 freq rowers - 3 freq rerek - 1 freq rewirk - 1 freq rorys - 1 freq rohres - 1 freq rur's - 2 freq rer's - 1 freq rurick - 1 freq re-org - 1 freq roorooyes - 1 freq |
MetaPhone code - RRK rerek - 1 freq rörick - 1 freq rurick - 1 freq re-org - 1 freq |
REREK |
| Time to execute Levenshtein function - 0.208756 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.361221 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.027675 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.042590 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.005560 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. |