| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rare (0) - 296 freq rage (1) - 80 freq dare (1) - 57 freq rae (1) - 13 freq yare (1) - 1 freq bare (1) - 171 freq pare (1) - 5 freq rape (1) - 19 freq mare (1) - 190 freq rared (1) - 2 freq 'rare (1) - 1 freq rade (1) - 24 freq rane (1) - 3 freq fare (1) - 62 freq rase (1) - 37 freq rake (1) - 31 freq rar (1) - 1 freq rame (1) - 3 freq nare (1) - 1 freq eare (1) - 1 freq hare (1) - 199 freq orare (1) - 2 freq care (1) - 462 freq are (1) - 5053 freq ware (1) - 26 freq |
rare (0) - 296 freq rre (1) - 1 freq orare (1) - 2 freq rar (1) - 1 freq rale (2) - 78 freq rave (2) - 9 freq gare (2) - 1 freq rate (2) - 101 freq race (2) - 139 freq kare (2) - 1 freq sare (2) - 30 freq lare (2) - 7 freq rora (2) - 2 freq 'are (2) - 61 freq ruary (2) - 1 freq roarie (2) - 2 freq rairie (2) - 3 freq rorie (2) - 3 freq rur (2) - 3 freq rory (2) - 15 freq rair (2) - 30 freq rr (2) - 1 freq rer (2) - 3 freq roar (2) - 81 freq rear (2) - 29 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 |
RARE |
| Time to execute Levenshtein function - 0.200551 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.340472 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.027443 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.036912 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.000827 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. |