| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rare (0) - 301 freq yare (1) - 1 freq rake (1) - 31 freq rar (1) - 1 freq pare (1) - 5 freq dare (1) - 61 freq are (1) - 5138 freq rame (1) - 3 freq kare (1) - 1 freq rage (1) - 85 freq hare (1) - 199 freq rale (1) - 78 freq race (1) - 139 freq care (1) - 465 freq eare (1) - 1 freq rade (1) - 24 freq rate (1) - 100 freq orare (1) - 2 freq tare (1) - 4 freq rase (1) - 37 freq rane (1) - 3 freq rarer (1) - 8 freq 'are (1) - 64 freq rave (1) - 10 freq gare (1) - 1 freq |
rare (0) - 301 freq orare (1) - 2 freq rre (1) - 1 freq rar (1) - 1 freq rape (2) - 19 freq sare (2) - 30 freq ware (2) - 27 freq rared (2) - 2 freq bare (2) - 175 freq nare (2) - 1 freq mare (2) - 190 freq rae (2) - 13 freq 'rare (2) - 1 freq rr (2) - 1 freq rer (2) - 3 freq rairie (2) - 3 freq roarie (2) - 2 freq rora (2) - 2 freq rur (2) - 3 freq rorie (2) - 3 freq rair (2) - 30 freq rear (2) - 29 freq roar (2) - 81 freq ruary (2) - 1 freq fare (2) - 64 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 |
RARE |
| Time to execute Levenshtein function - 0.207096 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.367168 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.028998 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.037837 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.000933 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. |