| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rochlookin (0) - 1 freq rochlin (3) - 1 freq goodlookin (3) - 1 freq rough-lookin (3) - 1 freq onlookin (3) - 2 freq rum-lookin (3) - 1 freq clokkin (4) - 1 freq re-plooin (4) - 1 freq crochlin (4) - 1 freq ill-lookin (4) - 3 freq bollockin (4) - 1 freq lookin (4) - 985 freq rockin (4) - 18 freq rollickin (4) - 1 freq cookin (4) - 44 freq odd-lookin (4) - 1 freq 'chookie (4) - 2 freq clootin (4) - 2 freq choakin (4) - 1 freq cloorin (4) - 1 freq chookie (4) - 66 freq choosin (4) - 13 freq rochle-lik (4) - 1 freq pochlin (4) - 1 freq tough-lookin (4) - 1 freq |
rochlookin (0) - 1 freq rochlin (4) - 1 freq rough-lookin (5) - 1 freq rum-lookin (5) - 1 freq chowkin (6) - 1 freq cloakin (6) - 1 freq drochlin (6) - 2 freq cochlin (6) - 1 freq schoolin (6) - 4 freq chokin (6) - 29 freq dreich-lookin (6) - 1 freq chokkin (6) - 1 freq choakin (6) - 1 freq unco-lookin (6) - 1 freq pochlin (6) - 1 freq crochlin (6) - 1 freq onlookin (6) - 2 freq chalkin (6) - 1 freq goodlookin (6) - 1 freq rockin (6) - 18 freq recoilin (7) - 1 freq claikin (7) - 11 freq rochly (7) - 3 freq richtifyin (7) - 1 freq oorie-lookin (7) - 1 freq |
SoundEx code - R242 rough-lookin - 1 freq recalcitrate - 1 freq recalls - 5 freq rackless - 1 freq rickles - 4 freq reek-less - 1 freq recollection - 2 freq risqué-leukin - 1 freq rochlookin - 1 freq rascals - 1 freq russell's - 3 freq resiles - 1 freq reckless - 2 freq rachel's - 2 freq roch-lik - 1 freq recklessness - 2 freq ruckles - 1 freq recleckit - 1 freq ragglish-like - 1 freq ragglish - 3 freq recollections - 1 freq reclessified - 1 freq recalcitrant - 2 freq recoils - 1 freq reishils - 1 freq rochles - 1 freq reekless - 1 freq roxywells - 3 freq regulus - 2 freq rossalcroft - 1 freq rjhhlckmda - 1 freq rosscolquhoun - 2 freq russellexolta - 1 freq reclusive - 1 freq rglktwyp - 1 freq |
MetaPhone code - RXLKN rochlookin - 1 freq |
ROCHLOOKIN |
| Time to execute Levenshtein function - 0.229949 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.411053 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.028013 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.038491 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.000845 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. |