| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reared (0) - 24 freq heared (1) - 14 freq geared (1) - 2 freq rared (1) - 2 freq feared (1) - 35 freq weared (1) - 1 freq reamed (1) - 1 freq roared (1) - 93 freq neared (1) - 3 freq seared (1) - 2 freq teared (1) - 1 freq leared (1) - 1 freq raved (2) - 3 freq revered (2) - 3 freq peard (2) - 1 freq retired (2) - 40 freq scared (2) - 44 freq smeared (2) - 6 freq razed (2) - 2 freq prepared (2) - 42 freq rears (2) - 2 freq eased (2) - 3 freq relied (2) - 4 freq fared (2) - 11 freq reaper (2) - 16 freq |
reared (0) - 24 freq roared (1) - 93 freq rared (1) - 2 freq erred (2) - 1 freq teared (2) - 1 freq leared (2) - 1 freq raired (2) - 39 freq seared (2) - 2 freq reread (2) - 2 freq geared (2) - 2 freq neared (2) - 3 freq feared (2) - 35 freq heared (2) - 14 freq reamed (2) - 1 freq weared (2) - 1 freq serred (3) - 9 freq raked (3) - 16 freq retard (3) - 2 freq year'd (3) - 1 freq leered (3) - 1 freq raxed (3) - 103 freq wearied (3) - 9 freq raced (3) - 14 freq rear (3) - 29 freq reward (3) - 46 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 |
REARED |
| Time to execute Levenshtein function - 0.200483 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.339860 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.027291 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.037124 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.000819 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. |