| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| raired (0) - 39 freq raird (1) - 1 freq paired (1) - 1 freq waired (1) - 1 freq haired (1) - 5 freq laired (1) - 8 freq rared (1) - 2 freq faired (1) - 2 freq railed (1) - 2 freq raiked (1) - 5 freq saired (1) - 7 freq raiped (1) - 5 freq rained (1) - 13 freq raided (1) - 4 freq raised (1) - 160 freq aire (2) - 61 freq raped (2) - 5 freq hatred (2) - 27 freq rairs (2) - 3 freq jared (2) - 3 freq haived (2) - 10 freq barred (2) - 15 freq rimed (2) - 1 freq faire (2) - 1 freq maire (2) - 146 freq |
raired (0) - 39 freq rared (1) - 2 freq raird (1) - 1 freq rained (2) - 13 freq raiped (2) - 5 freq reared (2) - 24 freq roared (2) - 93 freq saired (2) - 7 freq raided (2) - 4 freq raised (2) - 160 freq raiked (2) - 5 freq haired (2) - 5 freq paired (2) - 1 freq waired (2) - 1 freq laired (2) - 8 freq railed (2) - 2 freq faired (2) - 2 freq ruised (3) - 5 freq airted (3) - 31 freq rairin (3) - 22 freq repaired (3) - 8 freq tarred (3) - 4 freq reined (3) - 2 freq retired (3) - 40 freq heired (3) - 3 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 |
RAIRED |
| Time to execute Levenshtein function - 0.242302 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.368287 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.027535 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.036857 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.000894 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. |