| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rair (0) - 30 freq mair (1) - 6074 freq nair (1) - 2 freq rairs (1) - 3 freq rain (1) - 672 freq raik (1) - 25 freq fair (1) - 1516 freq raird (1) - 1 freq reir (1) - 1 freq wair (1) - 6 freq 'air (1) - 1 freq rar (1) - 1 freq bair (1) - 1 freq hair (1) - 867 freq gair (1) - 3 freq dair (1) - 11 freq rairt (1) - 1 freq raip (1) - 32 freq raid (1) - 25 freq pair (1) - 492 freq cair (1) - 3 freq rail (1) - 29 freq rait (1) - 3 freq yair (1) - 1 freq lair (1) - 57 freq |
rair (0) - 30 freq reir (1) - 1 freq rar (1) - 1 freq air (2) - 970 freq sair (2) - 772 freq lair (2) - 57 freq rail (2) - 29 freq rait (2) - 3 freq yair (2) - 1 freq rur (2) - 3 freq rer (2) - 3 freq rairie (2) - 3 freq rare (2) - 296 freq reer (2) - 1 freq rear (2) - 29 freq rior (2) - 1 freq roar (2) - 81 freq ruairi (2) - 1 freq cair (2) - 3 freq rr (2) - 1 freq rain (2) - 672 freq rairs (2) - 3 freq wair (2) - 6 freq raik (2) - 25 freq fair (2) - 1516 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 |
RAIR |
| Time to execute Levenshtein function - 0.181283 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.321878 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.029267 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.041431 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.000817 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. |