| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unlokket (0) - 1 freq nokket (2) - 2 freq unlockit (2) - 2 freq lokket (2) - 3 freq onlokkit (2) - 1 freq unlocked (2) - 4 freq blokkit (3) - 1 freq slokkit (3) - 1 freq unlockan (3) - 1 freq locket (3) - 5 freq slokken (3) - 1 freq nocket (3) - 1 freq unloakin (3) - 1 freq unhooked (3) - 1 freq uncooked (3) - 1 freq unlike (3) - 43 freq unlockin (3) - 2 freq clocket (3) - 1 freq unblockit (3) - 3 freq unloadit (3) - 1 freq unhowkit (3) - 1 freq lokken (3) - 1 freq blocket (3) - 1 freq unspokken (3) - 1 freq bloaket (3) - 1 freq |
unlokket (0) - 1 freq onlokkit (2) - 1 freq onlukkit (3) - 1 freq lokket (3) - 3 freq nokket (3) - 2 freq unlockit (3) - 2 freq slokkit (4) - 1 freq blokkit (4) - 1 freq unlocked (4) - 4 freq glekkit (5) - 2 freq unlock (5) - 7 freq iiokket (5) - 1 freq unlocks (5) - 2 freq looket (5) - 36 freq likkit (5) - 2 freq lukkt (5) - 1 freq nyakkit (5) - 2 freq bloaket (5) - 1 freq belikkit (5) - 1 freq aflikkit (5) - 1 freq clekkit (5) - 1 freq lukkit (5) - 6 freq inlaikit (5) - 1 freq locket (5) - 5 freq clocket (5) - 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 - UNLKT unlokket - 1 freq unlocked - 4 freq unlockit - 2 freq |
UNLOKKET |
| Time to execute Levenshtein function - 0.277515 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.372213 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.029283 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.039316 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.000897 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. |