| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rural (0) - 28 freq mural (1) - 1 freq aural (1) - 1 freq rival (2) - 14 freq rugas (2) - 1 freq real (2) - 592 freq murals (2) - 8 freq rua (2) - 3 freq regal (2) - 2 freq dual (2) - 7 freq ruill (2) - 2 freq rosal (2) - 1 freq frugal (2) - 4 freq rur (2) - 3 freq burial (2) - 12 freq ryal (2) - 3 freq feral (2) - 6 freq url (2) - 1 freq reuril (2) - 1 freq furl (2) - 6 freq coral (2) - 5 freq wurl (2) - 2 freq burl (2) - 6 freq rum'l (2) - 1 freq cral (2) - 1 freq |
rural (0) - 28 freq rooral (2) - 1 freq reuril (2) - 1 freq mural (2) - 1 freq orral (2) - 6 freq aural (2) - 1 freq burel (3) - 1 freq rarely (3) - 43 freq cral (3) - 1 freq burl (3) - 6 freq oral (3) - 23 freq royal (3) - 174 freq otral (3) - 1 freq rora (3) - 2 freq viral (3) - 3 freq moral (3) - 88 freq gurl (3) - 2 freq hurl (3) - 64 freq wurl (3) - 2 freq purl (3) - 3 freq murl (3) - 2 freq curl (3) - 12 freq regal (3) - 2 freq rur (3) - 3 freq rosal (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.212017 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.401711 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.027389 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.039910 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.000921 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. |