Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unloakin (0) - 1 freq unloadin (1) - 6 freq unlockin (1) - 2 freq uploadin (2) - 1 freq unloadit (2) - 1 freq cloakin (2) - 1 freq unlockit (2) - 2 freq uncorkin (2) - 1 freq onlookin (2) - 2 freq unlockan (2) - 1 freq unladin (2) - 1 freq cloakit (3) - 2 freq unlearn (3) - 2 freq unheukin (3) - 1 freq reloadin (3) - 1 freq undaein (3) - 2 freq bloackin (3) - 1 freq knockin (3) - 42 freq unlearnin (3) - 1 freq invokin (3) - 1 freq plonkin (3) - 3 freq loafin (3) - 1 freq loackin (3) - 2 freq undoin (3) - 1 freq snorkin (3) - 1 freq |
unloakin (0) - 1 freq onlookin (2) - 2 freq unlockin (2) - 2 freq unloadin (2) - 6 freq unlockan (3) - 1 freq unladin (3) - 1 freq cloakin (3) - 1 freq onluikin (3) - 1 freq lakin (4) - 1 freq lookin (4) - 985 freq unlairn (4) - 1 freq leakin (4) - 12 freq unkin (4) - 4 freq invokin (4) - 1 freq slakin (4) - 1 freq unlivin (4) - 1 freq uncorkin (4) - 1 freq unlearn (4) - 2 freq unlockit (4) - 2 freq unloadit (4) - 1 freq uploadin (4) - 1 freq unheukin (4) - 1 freq flakin (4) - 1 freq lokin (4) - 1 freq sleekin (5) - 5 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 - UNLKN unloakin - 1 freq unlockin - 2 freq unlockan - 1 freq |
UNLOAKIN |
Time to execute Levenshtein function - 0.269303 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.354873 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.028371 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.038567 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.000943 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. |