| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cookery (1) - 4 freq rockery (1) - 1 freq roodery (1) - 1 freq sookers (2) - 2 freq trookers (2) - 2 freq mockery (2) - 9 freq rokeby (2) - 1 freq rooney (2) - 5 freq dookers (2) - 10 freq cooker (2) - 21 freq trooker (2) - 2 freq sooker (2) - 2 freq rocker (2) - 3 freq looker (2) - 8 freq footery (2) - 6 freq foolery (2) - 2 freq rocketry (2) - 1 freq rookery's (2) - 1 freq crockery (2) - 2 freq hookers (2) - 2 freq robbery (2) - 8 freq rooked (2) - 1 freq poodery (2) - 2 freq hooker (2) - 4 freq router (3) - 1 freq |
cookery (2) - 4 freq roodery (2) - 1 freq rockery (2) - 1 freq looker (3) - 8 freq sooker (3) - 2 freq raker (3) - 2 freq hooker (3) - 4 freq trooker (3) - 2 freq rooked (3) - 1 freq rocker (3) - 3 freq cooker (3) - 21 freq rokeby (3) - 1 freq yorker (3) - 1 freq rory (4) - 15 freq toker (4) - 1 freq troker (4) - 1 freq hoker (4) - 1 freq fakery (4) - 1 freq rooks (4) - 6 freq bakery (4) - 16 freq yerker (4) - 1 freq rokelay (4) - 1 freq jouker (4) - 2 freq rookle (4) - 3 freq poker (4) - 21 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 - 5 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 |
ROOKERY |
| Time to execute Levenshtein function - 0.183898 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.338010 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.027408 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.040053 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.001068 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. |