| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roared (0) - 93 freq roaren (1) - 6 freq soared (1) - 6 freq reared (1) - 24 freq roamed (1) - 3 freq roar'd (1) - 1 freq rared (1) - 2 freq roofed (2) - 2 freq roped (2) - 1 freq daared (2) - 2 freq raired (2) - 39 freq rated (2) - 3 freq toured (2) - 3 freq roars (2) - 22 freq roaran (2) - 4 freq woarld (2) - 7 freq roarin (2) - 60 freq rowted (2) - 1 freq seared (2) - 2 freq fared (2) - 11 freq poored (2) - 56 freq leared (2) - 1 freq soarey (2) - 1 freq wared (2) - 9 freq oaged (2) - 1 freq |
roared (0) - 93 freq rared (1) - 2 freq reared (1) - 24 freq raired (2) - 39 freq roar'd (2) - 1 freq roaren (2) - 6 freq roamed (2) - 3 freq soared (2) - 6 freq rooked (3) - 1 freq teared (3) - 1 freq soured (3) - 1 freq feared (3) - 35 freq coored (3) - 2 freq weared (3) - 1 freq raged (3) - 13 freq raked (3) - 16 freq arrayed (3) - 3 freq heared (3) - 14 freq raced (3) - 14 freq board (3) - 150 freq roarit (3) - 6 freq rarer (3) - 8 freq moored (3) - 2 freq rare (3) - 296 freq erred (3) - 1 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 |
ROARED |
| Time to execute Levenshtein function - 0.196979 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.325465 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.027102 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.036869 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.000839 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. |