| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rarely (0) - 43 freq ralely (1) - 5 freq barely (1) - 97 freq sarely (1) - 1 freq rare (2) - 301 freq namely (2) - 10 freq rabels (2) - 1 freq parly (2) - 2 freq nately (2) - 2 freq farel (2) - 1 freq quarely (2) - 5 freq warily (2) - 3 freq purely (2) - 16 freq soarely (2) - 1 freq rairly (2) - 1 freq rely (2) - 16 freq wardly (2) - 1 freq reely (2) - 9 freq sirely (2) - 1 freq largely (2) - 6 freq halely (2) - 7 freq hamely (2) - 45 freq rawly (2) - 1 freq raedy (2) - 4 freq eardly (2) - 1 freq |
rarely (0) - 43 freq rairly (2) - 1 freq sarely (2) - 1 freq barely (2) - 97 freq ralely (2) - 5 freq merely (3) - 12 freq railly (3) - 1 freq rarer (3) - 8 freq rared (3) - 2 freq eardly (3) - 1 freq ravel (3) - 2 freq rally (3) - 10 freq harly (3) - 13 freq raelly (3) - 67 freq sorely (3) - 2 freq rarity (3) - 3 freq rural (3) - 28 freq rael (3) - 110 freq rudely (3) - 3 freq surely (3) - 184 freq rawly (3) - 1 freq early (3) - 366 freq bareley (3) - 1 freq purely (3) - 16 freq soarely (3) - 1 freq |
SoundEx code - R640 rarely - 43 freq rairly - 1 freq rural - 28 freq rooral - 1 freq reuril - 1 freq |
MetaPhone code - RRL rarely - 43 freq rairly - 1 freq rural - 28 freq rooral - 1 freq reuril - 1 freq |
RARELY |
| Time to execute Levenshtein function - 0.188582 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.397502 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.033794 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.043919 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.000912 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. |