| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rur (0) - 3 freq ruk (1) - 4 freq our (1) - 496 freq bur (1) - 8 freq rua (1) - 3 freq pur (1) - 5 freq r'ur (1) - 1 freq cur (1) - 6 freq rr (1) - 1 freq ru (1) - 1 freq nur (1) - 61 freq aur (1) - 1 freq wur (1) - 1618 freq run (1) - 634 freq rlr (1) - 1 freq rer (1) - 3 freq ruz (1) - 3 freq rut (1) - 7 freq rub (1) - 51 freq brur (1) - 23 freq fur (1) - 7713 freq hur (1) - 856 freq rue (1) - 19 freq rux (1) - 1 freq rug (1) - 50 freq |
rur (0) - 3 freq rar (1) - 1 freq rer (1) - 3 freq rr (1) - 1 freq rair (2) - 30 freq irr (2) - 2 freq err (2) - 40 freq ruk (2) - 4 freq tur (2) - 2 freq ur (2) - 604 freq rum (2) - 32 freq yur (2) - 221 freq dur (2) - 1 freq rnr (2) - 1 freq eur (2) - 1 freq rora (2) - 2 freq urr (2) - 40 freq roar (2) - 81 freq rare (2) - 301 freq reir (2) - 1 freq orr (2) - 16 freq ruary (2) - 1 freq rear (2) - 29 freq rre (2) - 1 freq rory (2) - 15 freq |
SoundEx code - R600 rair - 30 freq rerr - 21 freq rare - 301 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 - 21 freq rare - 301 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 |
RUR |
| Time to execute Levenshtein function - 0.194624 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.363542 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.028043 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.039727 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.000925 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. |