| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cuikery (0) - 1 freq cuiter (2) - 1 freq crikey (2) - 5 freq cuiver (2) - 4 freq bunkery (2) - 2 freq cookery (2) - 4 freq quiskery (2) - 1 freq cutlery (2) - 15 freq cuivert (2) - 2 freq cuivers (2) - 2 freq fusker (3) - 1 freq burker (3) - 2 freq curers (3) - 1 freq chimera (3) - 2 freq rubbery (3) - 7 freq trickery (3) - 1 freq cutesy (3) - 1 freq musketry (3) - 1 freq cuikin (3) - 7 freq likely (3) - 311 freq guisers (3) - 8 freq auskerry (3) - 1 freq busker (3) - 2 freq crier (3) - 2 freq unker (3) - 4 freq |
cuikery (0) - 1 freq cookery (2) - 4 freq cuiter (3) - 1 freq cuiver (3) - 4 freq cooker (3) - 21 freq fakery (4) - 1 freq cuik (4) - 4 freq cuuver (4) - 1 freq cuiks (4) - 2 freq quackery (4) - 1 freq canker (4) - 4 freq ciky (4) - 1 freq baiker (4) - 1 freq zucker (4) - 1 freq bakery (4) - 16 freq pucker (4) - 1 freq cuter (4) - 1 freq caulker (4) - 1 freq geekery (4) - 1 freq fucker (4) - 22 freq quicker (4) - 57 freq liker (4) - 9 freq cicero (4) - 1 freq cider (4) - 38 freq cheery (4) - 43 freq |
SoundEx code - C260 cooker - 21 freq couser - 2 freq cigar - 19 freq cheshire - 10 freq choisir - 1 freq cocker - 1 freq choaker - 7 freq chaser - 9 freq cesare - 1 freq cooser - 3 freq cashier - 1 freq cesar - 2 freq chowker - 7 freq cheugher - 1 freq cookery - 4 freq caesar - 17 freq caesarea - 1 freq checker - 5 freq choocher - 1 freq choker - 1 freq cicero - 1 freq caesura - 2 freq 'chaser' - 4 freq chaucer - 4 freq ceegar - 1 freq €˜ceegar - 1 freq cuikery - 1 freq co-cairry - 1 freq cougar - 1 freq chakra - 1 freq cowzer - 1 freq chekker - 1 freq |
MetaPhone code - KKR quicker - 57 freq cooker - 21 freq cocker - 1 freq queeker - 4 freq keeker - 3 freq cookery - 4 freq quackery - 1 freq qikur - 1 freq cuikery - 1 freq co-cairry - 1 freq cougar - 1 freq qiucker - 1 freq khkr - 1 freq gokr - 1 freq |
CUIKERY |
| Time to execute Levenshtein function - 0.230591 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.370321 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.032062 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.043270 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.001049 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. |