| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cleaner (0) - 31 freq cleane (1) - 1 freq cleaners (1) - 8 freq cleanser (1) - 2 freq clearer (1) - 26 freq cleaver (1) - 4 freq cleaned (1) - 35 freq clanger (2) - 1 freq cleanly (2) - 4 freq clane (2) - 4 freq eleanor (2) - 10 freq cleaves (2) - 1 freq clever (2) - 66 freq cleer (2) - 6 freq cleanin (2) - 48 freq cheater (2) - 1 freq clean (2) - 349 freq claer (2) - 22 freq cleanse (2) - 3 freq cheaper (2) - 14 freq cleansed (2) - 5 freq cleanan (2) - 2 freq cleave (2) - 3 freq gleaned (2) - 1 freq claver (2) - 14 freq |
cleaner (0) - 31 freq cleaned (2) - 35 freq cleane (2) - 1 freq clearer (2) - 26 freq cleaver (2) - 4 freq cleaners (2) - 8 freq cleanser (2) - 2 freq claver (3) - 14 freq planer (3) - 1 freq cleanan (3) - 2 freq cleans (3) - 9 freq clear (3) - 486 freq cloaser (3) - 5 freq cleanse (3) - 3 freq cleaneen (3) - 1 freq clene (3) - 3 freq cleant (3) - 4 freq claer (3) - 22 freq cleanin (3) - 48 freq cleer (3) - 6 freq eleanor (3) - 10 freq clever (3) - 66 freq clane (3) - 4 freq cleanly (3) - 4 freq clanger (3) - 1 freq |
SoundEx code - C456 cleaner - 31 freq climmer - 1 freq clamour - 8 freq clammert - 1 freq chalmer - 2 freq claymore - 8 freq chaulmer - 1 freq coolnahoarna - 1 freq clammered - 2 freq cleaners - 8 freq claymores - 2 freq chalmers - 15 freq clawhammer - 1 freq clamouran - 1 freq climmeran - 1 freq clawmarks - 1 freq chalmeris - 1 freq colmer - 1 freq climmirn - 1 freq calmer - 2 freq colineurosonic - 1 freq callumrwalker - 1 freq calumwright - 15 freq calmarkel - 1 freq |
MetaPhone code - KLNR cleaner - 31 freq killonerry - 1 freq glenore - 6 freq glenure - 7 freq |
CLEANER |
| Time to execute Levenshtein function - 0.183509 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.340209 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.028045 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.036869 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.000824 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. |