| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unleash (0) - 2 freq unleasht (1) - 2 freq unlearn (2) - 2 freq uneasy (2) - 18 freq leash (2) - 12 freq unleashit (2) - 1 freq unleashin (2) - 2 freq unbeast (2) - 2 freq unleashed (2) - 1 freq unless (2) - 137 freq unlear (2) - 1 freq unease (2) - 6 freq lease (3) - 14 freq leas (3) - 14 freq unclean' (3) - 1 freq plash (3) - 6 freq neath (3) - 4 freq 'neath (3) - 2 freq unsealt (3) - 1 freq uncast (3) - 1 freq flash (3) - 76 freq splesh (3) - 2 freq unlaek (3) - 3 freq unean (3) - 1 freq unlatch (3) - 1 freq |
unleash (0) - 2 freq unleasht (2) - 2 freq unleashin (3) - 2 freq unless (3) - 137 freq unleashit (3) - 1 freq unleashed (3) - 1 freq leash (3) - 12 freq slash (4) - 9 freq fleesh (4) - 3 freq onless (4) - 7 freq engleesh (4) - 9 freq blash (4) - 1 freq flesh (4) - 121 freq leish (4) - 2 freq enless (4) - 12 freq clash (4) - 41 freq inglesh (4) - 3 freq fleish (4) - 3 freq clesh (4) - 1 freq gleesh (4) - 1 freq nash (4) - 2 freq nesh (4) - 4 freq lash (4) - 16 freq angleesh (4) - 7 freq leesh (4) - 2 freq |
SoundEx code - U542 unless - 137 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 - 42 freq unalik - 2 freq unlokket - 1 freq unlocked - 5 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 unleashed - 1 freq |
MetaPhone code - UNLX unleash - 2 freq unlatch - 1 freq |
UNLEASH |
| Time to execute Levenshtein function - 0.221226 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.402057 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.029359 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.037528 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.000879 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. |