| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cleaners (0) - 8 freq cleaner (1) - 32 freq clears (2) - 19 freq cleanest (2) - 1 freq clean's (2) - 1 freq clearer (2) - 26 freq learners (2) - 6 freq leavers (2) - 1 freq cleaver (2) - 4 freq cleaneen (2) - 1 freq cleans (2) - 9 freq cleaves (2) - 1 freq cleane (2) - 1 freq clangers (2) - 1 freq cleanser (2) - 2 freq cheaters (2) - 1 freq clavers (2) - 15 freq cleaned (2) - 35 freq leaders (2) - 30 freq claturs (3) - 1 freq menners (3) - 2 freq gleans (3) - 1 freq chancers (3) - 3 freq €˜leaders (3) - 1 freq creepers (3) - 1 freq |
cleaners (0) - 8 freq cleaner (2) - 32 freq clangers (3) - 1 freq clavers (3) - 15 freq cleans (3) - 9 freq clears (3) - 19 freq clean's (3) - 1 freq clooers (4) - 1 freq clynes (4) - 1 freq clans (4) - 26 freq cinners (4) - 4 freq corners (4) - 36 freq clovers (4) - 2 freq claivers (4) - 2 freq crooners (4) - 2 freq calanders (4) - 1 freq colanders (4) - 1 freq clinkers (4) - 2 freq clones (4) - 1 freq coarners (4) - 9 freq loners (4) - 1 freq clan's (4) - 3 freq cleanse (4) - 3 freq cheaters (4) - 1 freq cleaned (4) - 35 freq |
SoundEx code - C456 cleaner - 32 freq climmer - 1 freq clamour - 8 freq clammert - 1 freq chalmer - 2 freq claymore - 8 freq chaulmer - 1 freq calmer - 3 freq clamar - 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 colineurosonic - 1 freq callumrwalker - 1 freq calumwright - 15 freq calmarkel - 1 freq |
MetaPhone code - KLNRS cleaners - 8 freq |
CLEANERS |
| Time to execute Levenshtein function - 0.219322 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.339094 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.028047 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.036826 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.000916 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. |