| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retard (0) - 2 freq petard (1) - 1 freq reward (1) - 47 freq regard (1) - 16 freq retards (1) - 1 freq regards (2) - 11 freq beard (2) - 57 freq rewaard (2) - 2 freq rewards (2) - 6 freq seward (2) - 2 freq rears (2) - 2 freq feard (2) - 1 freq return (2) - 132 freq he'ard (2) - 1 freq retro (2) - 8 freq remark (2) - 44 freq rear (2) - 29 freq repaid (2) - 1 freq reynard (2) - 3 freq redcard (2) - 1 freq retort (2) - 3 freq record (2) - 99 freq rotad (2) - 2 freq read (2) - 958 freq remand (2) - 2 freq |
retard (0) - 2 freq retired (2) - 42 freq retards (2) - 1 freq regard (2) - 16 freq petard (2) - 1 freq reward (2) - 47 freq rotary (3) - 3 freq regaird (3) - 39 freq rotad (3) - 2 freq retire (3) - 11 freq reteired (3) - 3 freq retirt (3) - 1 freq reared (3) - 24 freq recaird (3) - 1 freq remord (3) - 2 freq retir (3) - 1 freq record (3) - 99 freq rewaird (3) - 8 freq retort (3) - 3 freq rewaard (3) - 2 freq retro (3) - 8 freq return (3) - 132 freq retoured (3) - 14 freq reynard (3) - 3 freq arecord (4) - 1 freq |
SoundEx code - R363 retorts - 2 freq retard - 2 freq retired - 42 freq retreat - 26 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 - RTRT retard - 2 freq retired - 42 freq retreat - 26 freq retirt - 1 freq retort - 3 freq retirit - 3 freq retoured - 14 freq reteired - 3 freq rid-rid - 1 freq retourt - 1 freq retiret - 1 freq retir't - 1 freq rtreyd - 1 freq |
RETARD |
| Time to execute Levenshtein function - 0.215564 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.387745 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.028954 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.046084 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.000879 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. |