| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rior (0) - 1 freq prior (1) - 18 freq rio (1) - 5 freq rigor (1) - 1 freq pior (1) - 1 freq ior (1) - 1 freq riot (1) - 31 freq lion (2) - 147 freq fiot (2) - 1 freq 'for (2) - 29 freq rig (2) - 45 freq rov (2) - 1 freq oioo (2) - 1 freq por (2) - 2 freq nibor (2) - 2 freq fion (2) - 2 freq ir (2) - 1541 freq rool (2) - 1 freq 'oor (2) - 22 freq rioja (2) - 2 freq or (2) - 1 freq minor (2) - 15 freq rift (2) - 12 freq sir (2) - 358 freq rile (2) - 3 freq |
rior (0) - 1 freq roar (2) - 81 freq rr (2) - 1 freq irr (2) - 2 freq rora (2) - 2 freq reir (2) - 1 freq rear (2) - 29 freq rer (2) - 3 freq reer (2) - 1 freq rar (2) - 1 freq rory (2) - 15 freq rair (2) - 30 freq rur (2) - 3 freq pior (2) - 1 freq rigor (2) - 1 freq ior (2) - 1 freq rio (2) - 5 freq riot (2) - 31 freq prior (2) - 18 freq rok (3) - 1 freq root (3) - 35 freq riyt (3) - 3 freq jirr (3) - 1 freq ried (3) - 2 freq mir (3) - 5 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 |
RIOR |
| Time to execute Levenshtein function - 0.316424 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.624855 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.063084 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.089730 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.000881 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. |