| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rory (0) - 15 freq rorys (1) - 1 freq dory (1) - 1 freq roby (1) - 1 freq tory (1) - 132 freq nory (1) - 4 freq rosy (1) - 40 freq roy (1) - 54 freq gory (1) - 16 freq roly (1) - 8 freq cory (1) - 2 freq rora (1) - 2 freq lory (1) - 42 freq grory (1) - 1 freq rody (1) - 1 freq bury (2) - 24 freq norm (2) - 11 freq rr (2) - 1 freq sorr (2) - 1 freq rodd (2) - 90 freq 'oy (2) - 1 freq mort (2) - 3 freq rouk (2) - 10 freq roiz (2) - 1 freq porn (2) - 2 freq |
rory (0) - 15 freq rora (1) - 2 freq rr (2) - 1 freq arry (2) - 1 freq rorie (2) - 3 freq ruary (2) - 1 freq orr (2) - 16 freq rar (2) - 1 freq rer (2) - 3 freq rur (2) - 3 freq roar (2) - 81 freq rare (2) - 301 freq rody (2) - 1 freq rior (2) - 1 freq rre (2) - 1 freq tory (2) - 132 freq roy (2) - 54 freq grory (2) - 1 freq rosy (2) - 40 freq nory (2) - 4 freq roby (2) - 1 freq gory (2) - 16 freq lory (2) - 42 freq cory (2) - 2 freq rorys (2) - 1 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 |
RORY |
| Time to execute Levenshtein function - 0.194959 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.330781 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.027975 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.037072 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. |