| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rared (0) - 2 freq reared (1) - 24 freq raged (1) - 13 freq ramed (1) - 2 freq raxed (1) - 103 freq jared (1) - 3 freq rarer (1) - 8 freq raired (1) - 39 freq raked (1) - 16 freq pared (1) - 2 freq hared (1) - 1 freq bared (1) - 6 freq cared (1) - 32 freq roared (1) - 93 freq rated (1) - 3 freq raved (1) - 3 freq rare (1) - 296 freq dared (1) - 11 freq razed (1) - 2 freq raed (1) - 21 freq raced (1) - 14 freq raped (1) - 5 freq fared (1) - 11 freq wared (1) - 9 freq baaed (2) - 1 freq |
rared (0) - 2 freq roared (1) - 93 freq reared (1) - 24 freq raired (1) - 39 freq raed (2) - 21 freq dared (2) - 11 freq reread (2) - 2 freq rare (2) - 296 freq raced (2) - 14 freq raped (2) - 5 freq raird (2) - 1 freq wared (2) - 9 freq raved (2) - 3 freq fared (2) - 11 freq erred (2) - 1 freq razed (2) - 2 freq jared (2) - 3 freq rarer (2) - 8 freq rated (2) - 3 freq ramed (2) - 2 freq raged (2) - 13 freq raked (2) - 16 freq raxed (2) - 103 freq pared (2) - 2 freq cared (2) - 32 freq |
SoundEx code - R630 roared - 93 freq raired - 39 freq reward - 46 freq roart - 74 freq rewaird - 8 freq raird - 1 freq reared - 24 freq roarit - 6 freq roar't - 1 freq rearit - 1 freq reread - 2 freq rared - 2 freq rewaard - 1 freq roar'd - 1 freq ruaraidh - 10 freq rairt - 1 freq rewrite - 2 freq ruaridh - 1 freq rhuaridh - 1 freq ruariaidh - 2 freq rewrote - 1 freq rarity - 2 freq |
MetaPhone code - RRT roared - 93 freq raired - 39 freq roart - 74 freq raird - 1 freq reared - 24 freq roarit - 6 freq roar't - 1 freq rearit - 1 freq reread - 2 freq rared - 2 freq roar'd - 1 freq ruaraidh - 10 freq rairt - 1 freq rewrite - 2 freq ruaridh - 1 freq ruariaidh - 2 freq rewrote - 1 freq rarity - 2 freq |
RARED |
| Time to execute Levenshtein function - 0.615415 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.090687 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.102171 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.092525 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.000941 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. |