| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rairie (0) - 3 freq rainie (1) - 8 freq fairie (1) - 4 freq mairie (1) - 1 freq sairie (1) - 22 freq prairie (1) - 1 freq hairie (1) - 6 freq cairie (1) - 4 freq airie (1) - 1 freq rairin (1) - 22 freq lairie (1) - 2 freq apirie (2) - 1 freq rackie (2) - 1 freq reerie (2) - 4 freq raverie (2) - 1 freq lairdie (2) - 3 freq mairrie (2) - 7 freq rashie (2) - 1 freq hairrie (2) - 1 freq randie (2) - 8 freq maire (2) - 146 freq reizie (2) - 1 freq sairlie (2) - 6 freq rannie (2) - 3 freq airin (2) - 4 freq |
rairie (0) - 3 freq roarie (2) - 2 freq reerie (2) - 4 freq lairie (2) - 2 freq rare (2) - 301 freq rairin (2) - 22 freq ruairi (2) - 1 freq rorie (2) - 3 freq rair (2) - 30 freq airier (2) - 1 freq mairie (2) - 1 freq sairie (2) - 22 freq hairie (2) - 6 freq prairie (2) - 1 freq fairie (2) - 4 freq rainie (2) - 8 freq airie (2) - 1 freq cairie (2) - 4 freq reidie (3) - 2 freq rimie (3) - 2 freq raike (3) - 1 freq airse (3) - 13 freq ranyie (3) - 2 freq warie (3) - 1 freq oratrie (3) - 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 |
RAIRIE |
| Time to execute Levenshtein function - 0.234454 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.389928 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.029007 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.038086 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.000907 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. |