| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rural (0) - 28 freq mural (1) - 1 freq aural (1) - 1 freq plural (2) - 56 freq curl (2) - 11 freq rora (2) - 2 freq feral (2) - 5 freq burl (2) - 6 freq moral (2) - 88 freq rur (2) - 3 freq jura (2) - 3 freq €™ral (2) - 1 freq gurl (2) - 3 freq dura (2) - 1 freq coral (2) - 5 freq cral (2) - 1 freq real (2) - 565 freq runan (2) - 1 freq wurl (2) - 1 freq rwran (2) - 1 freq rosal (2) - 1 freq oral (2) - 22 freq otral (2) - 1 freq royal (2) - 172 freq furl (2) - 6 freq |
rural (0) - 28 freq orral (2) - 6 freq rooral (2) - 1 freq mural (2) - 1 freq reuril (2) - 1 freq aural (2) - 1 freq rarely (3) - 43 freq burel (3) - 1 freq regal (3) - 2 freq ruill (3) - 2 freq royal (3) - 172 freq furl (3) - 6 freq murl (3) - 2 freq hurl (3) - 63 freq purl (3) - 3 freq errol (3) - 2 freq rival (3) - 14 freq url (3) - 1 freq ryal (3) - 3 freq otral (3) - 1 freq viral (3) - 3 freq burial (3) - 12 freq rur (3) - 3 freq curl (3) - 11 freq cral (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 |
RURAL |
| Time to execute Levenshtein function - 0.484076 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.807881 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.074843 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.098881 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.001098 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. |