| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| recleckit (0) - 1 freq recheckit (1) - 1 freq refleckit (1) - 8 freq reflectit (2) - 16 freq reflekkit (2) - 3 freq rejeckit (2) - 9 freq cleckit (2) - 6 freq respeckit (2) - 15 freq negleckit (2) - 3 freq refleckin (2) - 4 freq eleckit (2) - 20 freq clockit (3) - 2 freq colleckit (3) - 5 freq relentit (3) - 1 freq perteckit (3) - 1 freq neglecit (3) - 1 freq begeckit (3) - 1 freq reckit (3) - 2 freq neglekkit (3) - 1 freq rejectit (3) - 3 freq cleukit (3) - 2 freq reflect (3) - 30 freq recreatit (3) - 1 freq henpeckit (3) - 1 freq neglectit (3) - 7 freq |
recleckit (0) - 1 freq recheckit (2) - 1 freq refleckit (2) - 8 freq cleckit (3) - 6 freq eleckit (4) - 20 freq clickit (4) - 7 freq refleckin (4) - 4 freq clockit (4) - 2 freq negleckit (4) - 3 freq reflekkit (4) - 3 freq reflectit (4) - 16 freq rejeckit (4) - 9 freq respeckit (4) - 15 freq clekkit (5) - 1 freq checkit (5) - 20 freq re-electit (5) - 1 freq cleckin (5) - 13 freq gleckit (5) - 1 freq sleckit (5) - 1 freq clenkit (5) - 1 freq clickt (5) - 2 freq cleikit (5) - 12 freq fleckit (5) - 3 freq clockt (5) - 1 freq replacit (5) - 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 - RKLKT recleckit - 1 freq |
RECLECKIT |
| Time to execute Levenshtein function - 0.291728 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.411288 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.027918 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.037740 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.000931 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. |