| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cleaning (0) - 14 freq cleanin' (1) - 3 freq cleanin (1) - 48 freq leaning (1) - 6 freq cleansing (1) - 2 freq clearing (1) - 3 freq weaning (2) - 1 freq teaning (2) - 1 freq leading (2) - 6 freq leaing (2) - 1 freq leaving (2) - 24 freq leanins (2) - 1 freq creating (2) - 8 freq leanin (2) - 49 freq clensing (2) - 1 freq gleaming (2) - 2 freq learning (2) - 33 freq cleanan (2) - 2 freq creaking (2) - 2 freq clearin (2) - 27 freq claping (2) - 1 freq clanking (2) - 1 freq gleanins (2) - 1 freq leaking (2) - 4 freq cheating (2) - 1 freq |
cleaning (0) - 14 freq cleansing (2) - 2 freq leaning (2) - 6 freq clearing (2) - 3 freq cleanin (2) - 48 freq cleanin' (2) - 3 freq clanking (3) - 1 freq clensing (3) - 1 freq cleanan (3) - 2 freq claping (3) - 1 freq clang (4) - 12 freq claiming (4) - 7 freq lining (4) - 1 freq cleansin (4) - 6 freq cunning (4) - 1 freq clyping (4) - 1 freq cling (4) - 7 freq cleaneen (4) - 1 freq crooning (4) - 2 freq closing (4) - 8 freq caining (4) - 1 freq clinin- (4) - 1 freq ceiling (4) - 11 freq clinging (4) - 1 freq clonin (4) - 2 freq |
SoundEx code - C455 cleanin - 48 freq cleaning - 14 freq climin - 6 freq claimin - 14 freq 'clementine' - 1 freq climmin - 17 freq colmonell - 1 freq clamin - 1 freq cullinan - 3 freq climmen - 1 freq culmination - 3 freq cleanin' - 3 freq coolnamuck - 1 freq clamant - 1 freq claimants - 2 freq clement's - 1 freq calamine - 1 freq clonin - 2 freq clinin- - 1 freq coalman - 1 freq cleaneen - 1 freq cleanan - 2 freq calmin - 3 freq clayman - 1 freq clemency - 2 freq claenin - 1 freq claiming - 7 freq calman - 1 freq cullanain - 1 freq cuillanain - 1 freq clementine - 1 freq collman - 1 freq culminatit - 1 freq coal-minin - 1 freq culminated - 1 freq claimant - 1 freq €˜clementine - 1 freq clements - 1 freq calming - 1 freq |
MetaPhone code - KLNNK cleaning - 14 freq |
CLEANING |
| Time to execute Levenshtein function - 0.173705 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.339007 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.028015 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.038049 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.000849 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. |