| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ruary (0) - 1 freq runty (2) - 1 freq feary (2) - 1 freq fuar (2) - 1 freq guard (2) - 38 freq scary (2) - 53 freq deary (2) - 4 freq jury (2) - 109 freq uayry (2) - 1 freq cary (2) - 1 freq reamy (2) - 2 freq rar (2) - 1 freq bury (2) - 24 freq guare (2) - 1 freq gary (2) - 103 freq roars (2) - 22 freq waary (2) - 1 freq vary (2) - 3 freq runny (2) - 2 freq rsyry (2) - 1 freq friary (2) - 2 freq ruairi (2) - 1 freq ruthy (2) - 2 freq 'gary (2) - 2 freq nary (2) - 2 freq |
ruary (0) - 1 freq rear (2) - 29 freq rare (2) - 296 freq rory (2) - 15 freq rur (2) - 3 freq roar (2) - 81 freq rar (2) - 1 freq ruairi (2) - 1 freq dury (3) - 1 freq haary (3) - 3 freq wary (3) - 11 freq curry (3) - 30 freq ray (3) - 17 freq realy (3) - 2 freq ury (3) - 2 freq array (3) - 16 freq rotary (3) - 3 freq quarry (3) - 60 freq fury (3) - 31 freq burry (3) - 1 freq urr (3) - 43 freq wurry (3) - 3 freq arry (3) - 1 freq rair (3) - 30 freq rora (3) - 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 |
RUARY |
| Time to execute Levenshtein function - 0.218546 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.349523 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.030111 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.039952 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.000853 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. |