| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unleashit (0) - 1 freq unleashin (1) - 2 freq unleasht (1) - 2 freq unwashit (2) - 1 freq unleash (2) - 2 freq unleashed (2) - 2 freq unwasht (3) - 1 freq plashit (3) - 1 freq unsheathit (3) - 1 freq unpleasant (3) - 4 freq unlearnin (3) - 1 freq pleasit (3) - 5 freq unbeast (3) - 2 freq unfasht (3) - 2 freq snashit (3) - 1 freq unloadit (3) - 1 freq unlandit (3) - 1 freq unheedit (4) - 1 freq unladin (4) - 1 freq pleadit (4) - 7 freq pleisit (4) - 2 freq gnashin (4) - 3 freq undantit (4) - 1 freq unquait (4) - 1 freq unship (4) - 1 freq |
unleashit (0) - 1 freq unleasht (1) - 2 freq unleashin (2) - 2 freq unleashed (3) - 2 freq unwashit (3) - 1 freq unleash (3) - 2 freq plashit (4) - 1 freq unwasht (4) - 1 freq unfasht (4) - 2 freq enlistit (5) - 1 freq unloadit (5) - 1 freq unlandit (5) - 1 freq clasht (5) - 4 freq snashit (5) - 1 freq unbeast (5) - 2 freq unpleasant (5) - 4 freq pleasit (5) - 5 freq pleast (6) - 6 freq leashed (6) - 1 freq clashin (6) - 9 freq creasht (6) - 1 freq unlyart (6) - 1 freq scleusht (6) - 1 freq bleacht (6) - 1 freq sleshin (6) - 1 freq |
SoundEx code - U542 unless - 139 freq unloakin - 1 freq unlucky - 29 freq unlock - 7 freq unwalcome - 3 freq 'unless - 4 freq unlikely - 22 freq unlockin - 2 freq unlocks - 2 freq unlike - 43 freq unalik - 3 freq unlokket - 1 freq unlocked - 4 freq unleashed - 2 freq unlik - 1 freq unleashin - 2 freq unwalcom - 1 freq unleasht - 2 freq unleashit - 1 freq unwelcum - 1 freq unalike - 12 freq unlockit - 2 freq unlik' - 1 freq unwelcome - 7 freq unleash - 2 freq unlockan - 1 freq unlozened - 1 freq unmalkied - 1 freq unlaek - 3 freq €¦unlike - 1 freq unmolested - 1 freq unloack - 1 freq unluckily - 1 freq unlæk - 1 freq unluckiest - 2 freq unelectit - 2 freq unlikelie - 1 freq unelected - 1 freq |
MetaPhone code - UNLXT unleashed - 2 freq unleasht - 2 freq unleashit - 1 freq |
UNLEASHIT |
| Time to execute Levenshtein function - 0.874367 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 - 1.217986 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.087739 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.107173 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. |