| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rar (0) - 1 freq rlr (1) - 1 freq rat (1) - 58 freq ear (1) - 139 freq ra (1) - 12 freq iar (1) - 2 freq jar (1) - 41 freq nar (1) - 15 freq rear (1) - 29 freq rhar (1) - 1 freq rnr (1) - 1 freq rzr (1) - 1 freq yar (1) - 3 freq har (1) - 8 freq car (1) - 404 freq aar (1) - 5 freq mar (1) - 16 freq raj (1) - 1 freq bar (1) - 492 freq raf (1) - 7 freq ray (1) - 17 freq dar (1) - 86 freq gar (1) - 162 freq par (1) - 10 freq rare (1) - 296 freq |
rar (0) - 1 freq rur (1) - 3 freq rair (1) - 30 freq rare (1) - 296 freq rer (1) - 3 freq roar (1) - 81 freq rear (1) - 29 freq rr (1) - 1 freq ram (2) - 33 freq raa (2) - 38 freq war (2) - 1438 freq far (2) - 1515 freq rpr (2) - 2 freq raz (2) - 1 freq rab (2) - 169 freq 'ar (2) - 1 freq rae (2) - 13 freq ran (2) - 448 freq rap (2) - 20 freq rora (2) - 2 freq rory (2) - 15 freq ruary (2) - 1 freq irr (2) - 2 freq rre (2) - 1 freq orare (2) - 2 freq |
SoundEx code - R600 rair - 30 freq rerr - 20 freq rare - 296 freq rairie - 3 freq roar - 81 freq rear - 29 freq reerie - 4 freq rior - 1 freq rewire - 2 freq re-wire - 1 freq reer - 1 freq re'r - 1 freq ruary - 1 freq rhar - 1 freq rorie - 3 freq 'rare - 1 freq reir - 1 freq rora - 2 freq roarie - 2 freq 'rerr - 1 freq rar - 1 freq rower - 2 freq r'ur - 1 freq rer - 3 freq rur - 3 freq ru'r - 1 freq rory - 15 freq 'rurie - 2 freq ruairi - 1 freq rawer - 1 freq royhair - 3 freq |
MetaPhone code - RR rair - 30 freq rerr - 20 freq rare - 296 freq rairie - 3 freq roar - 81 freq rear - 29 freq reerie - 4 freq rior - 1 freq reer - 1 freq re'r - 1 freq ruary - 1 freq rorie - 3 freq 'rare - 1 freq reir - 1 freq rora - 2 freq roarie - 2 freq 'rerr - 1 freq rar - 1 freq r'ur - 1 freq rer - 3 freq rur - 3 freq ru'r - 1 freq rory - 15 freq 'rurie - 2 freq ruairi - 1 freq |
RAR |
| Time to execute Levenshtein function - 0.205305 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.337769 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.029088 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.039575 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.000862 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. |