| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rarer (0) - 8 freq racer (1) - 1 freq rared (1) - 2 freq rawer (1) - 1 freq rare (1) - 296 freq raker (1) - 2 freq farer (1) - 1 freq raver (1) - 4 freq carer (1) - 10 freq razer (1) - 1 freq razor (2) - 14 freq rayner (2) - 1 freq dearer (2) - 8 freq parker (2) - 19 freq warker (2) - 7 freq faurer (2) - 34 freq earner (2) - 2 freq aner (2) - 2 freq faer (2) - 59 freq fayer (2) - 3 freq majer (2) - 1 freq traber (2) - 1 freq eager (2) - 27 freq ruder (2) - 2 freq rake (2) - 31 freq |
rarer (0) - 8 freq razer (2) - 1 freq rerr (2) - 20 freq arrr (2) - 2 freq raver (2) - 4 freq orrer (2) - 1 freq carer (2) - 10 freq farer (2) - 1 freq rawer (2) - 1 freq rared (2) - 2 freq raker (2) - 2 freq racer (2) - 1 freq rare (2) - 296 freq error (3) - 16 freq rimer (3) - 1 freq river (3) - 264 freq raider (3) - 1 freq marr (3) - 5 freq farrer (3) - 27 freq orare (3) - 2 freq rer (3) - 3 freq roared (3) - 93 freq farr (3) - 1 freq riper (3) - 4 freq ofrer (3) - 1 freq |
SoundEx code - R660 rarer - 8 freq |
MetaPhone code - RRR rarer - 8 freq |
RARER |
| Time to execute Levenshtein function - 0.222677 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.317110 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.027242 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.042936 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.000930 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. |