| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| raired (0) - 39 freq waired (1) - 1 freq haired (1) - 7 freq railed (1) - 2 freq raiped (1) - 5 freq rained (1) - 13 freq saired (1) - 7 freq laired (1) - 8 freq rared (1) - 2 freq raised (1) - 164 freq raided (1) - 4 freq faired (1) - 2 freq paired (1) - 1 freq raird (1) - 1 freq raiked (1) - 5 freq fraized (2) - 4 freq sired (2) - 2 freq failed (2) - 50 freq rated (2) - 3 freq razored (2) - 1 freq trailed (2) - 17 freq taured (2) - 2 freq maimed (2) - 2 freq radioed (2) - 1 freq racked (2) - 5 freq |
raired (0) - 39 freq rared (1) - 2 freq raird (1) - 1 freq raided (2) - 4 freq reared (2) - 24 freq faired (2) - 2 freq paired (2) - 1 freq raised (2) - 164 freq roared (2) - 93 freq raiked (2) - 5 freq railed (2) - 2 freq waired (2) - 1 freq laired (2) - 8 freq haired (2) - 7 freq raiped (2) - 5 freq rained (2) - 13 freq saired (2) - 7 freq bared (3) - 6 freq ramrod (3) - 1 freq gaird (3) - 61 freq airned (3) - 1 freq rairin (3) - 22 freq rimed (3) - 1 freq hared (3) - 1 freq baird (3) - 34 freq |
SoundEx code - R630 roared - 93 freq raired - 39 freq reward - 47 freq roart - 74 freq rewaird - 8 freq raird - 1 freq reared - 24 freq roarit - 6 freq roar't - 1 freq rewaard - 2 freq rarity - 3 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 rhuaridh - 1 freq ruariaidh - 2 freq rewrote - 1 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 rarity - 3 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 |
RAIRED |
| Time to execute Levenshtein function - 0.199492 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.369440 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.031434 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.040397 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.001012 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. |