| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rockery (0) - 1 freq mockery (1) - 9 freq rocketry (1) - 1 freq crockery (1) - 2 freq rocker (1) - 3 freq docker (2) - 4 freq rockets (2) - 9 freq jockey (2) - 3 freq grocery (2) - 4 freq hockey (2) - 8 freq rockeen (2) - 1 freq rocky (2) - 21 freq rocked (2) - 6 freq rocher (2) - 5 freq locker (2) - 3 freq cookery (2) - 4 freq rocket (2) - 43 freq rokeby (2) - 1 freq robbery (2) - 8 freq lockers (2) - 4 freq dockers (2) - 12 freq loccery (2) - 1 freq roodery (2) - 1 freq rickety (2) - 7 freq cocker (2) - 1 freq |
rockery (0) - 1 freq rocker (1) - 3 freq crockery (2) - 2 freq mockery (2) - 9 freq rocketry (2) - 1 freq cookery (3) - 4 freq locker (3) - 3 freq rocket (3) - 43 freq roeckir (3) - 1 freq rocher (3) - 5 freq cocker (3) - 1 freq rickety (3) - 7 freq trickery (3) - 1 freq rocked (3) - 6 freq docker (3) - 4 freq rockeen (3) - 1 freq rocky (3) - 21 freq raker (4) - 2 freq yorker (4) - 1 freq rocks (4) - 88 freq rock (4) - 194 freq licker (4) - 1 freq cooker (4) - 21 freq racked (4) - 5 freq decker (4) - 12 freq |
SoundEx code - R260 razer - 1 freq richer - 15 freq reassuir - 2 freq reassure - 12 freq razzor - 2 freq razor - 14 freq rugger - 2 freq rocker - 3 freq rosary - 6 freq rigger - 2 freq rocher - 5 freq require - 10 freq racer - 1 freq racherie - 1 freq rosario - 1 freq rougher - 1 freq roger - 5 freq rockery - 1 freq regiar - 1 freq rigor - 1 freq rasher - 1 freq roeckir - 1 freq rouchir - 1 freq raigiar - 1 freq roucher - 2 freq recur - 1 freq €œroger - 3 freq raiser - 2 freq rougier - 2 freq rosr - 1 freq rsyry - 1 freq rigeur - 1 freq raker - 2 freq reekiewar - 1 freq rzr - 1 freq |
MetaPhone code - RKR rugger - 2 freq rocker - 3 freq rigger - 2 freq require - 10 freq rockery - 1 freq rigor - 1 freq roeckir - 1 freq recur - 1 freq raker - 2 freq |
ROCKERY |
| Time to execute Levenshtein function - 0.197442 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.359794 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.027969 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.037313 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.000875 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. |