| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retards (0) - 1 freq retard (1) - 2 freq rewards (1) - 6 freq regards (1) - 11 freq rewairds (2) - 1 freq reward (2) - 46 freq remarks (2) - 25 freq records (2) - 34 freq retails (2) - 1 freq dotards (2) - 1 freq regairds (2) - 15 freq retains (2) - 4 freq repares (2) - 1 freq redars (2) - 1 freq petard (2) - 1 freq reads (2) - 55 freq recoards (2) - 1 freq beards (2) - 12 freq rears (2) - 2 freq regard (2) - 16 freq retorts (2) - 2 freq returns (2) - 27 freq redds (3) - 2 freq dears (3) - 12 freq pearls (3) - 17 freq |
retards (0) - 1 freq rewards (2) - 6 freq regards (2) - 11 freq retard (2) - 2 freq regairds (3) - 15 freq recoards (3) - 1 freq retorts (3) - 2 freq returns (3) - 27 freq dotards (3) - 1 freq records (3) - 34 freq rewairds (3) - 1 freq retired (4) - 40 freq ritirs (4) - 1 freq rawyards (4) - 1 freq retours (4) - 4 freq treads (4) - 1 freq reuters (4) - 6 freq racords (4) - 4 freq tardis (4) - 2 freq reuter's (4) - 1 freq petard (4) - 1 freq reads (4) - 55 freq beards (4) - 12 freq redars (4) - 1 freq reward (4) - 46 freq |
SoundEx code - R363 retorts - 2 freq retard - 2 freq retired - 40 freq retreat - 25 freq retorted - 5 freq retirt - 1 freq rotterdam - 7 freq retort - 3 freq retortit - 2 freq retirit - 3 freq retreating - 1 freq retards - 1 freq rudyard - 2 freq retreatit - 7 freq retoured - 14 freq retreat't - 1 freq roadworthy - 2 freq reteired - 3 freq ratrettit - 1 freq rid-haired - 1 freq rid-rid - 1 freq retreatin - 1 freq retourt - 1 freq retiret - 1 freq rotary-dial - 1 freq retir't - 1 freq radioruderham - 1 freq rtreyd - 1 freq retreaded - 1 freq rethered - 1 freq ruthieredart - 10 freq retiredgreyhound - 2 freq |
MetaPhone code - RTRTS retorts - 2 freq retards - 1 freq |
RETARDS |
| Time to execute Levenshtein function - 0.246089 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.483171 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.036796 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.050708 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.000887 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. |