| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unlik (0) - 1 freq unalik (1) - 3 freq unlike (1) - 43 freq unlik' (1) - 1 freq unis (2) - 2 freq unlaek (2) - 3 freq uik (2) - 1 freq dunli (2) - 1 freq unk (2) - 1 freq onalik (2) - 1 freq unlock (2) - 7 freq until (2) - 495 freq unkil (2) - 4 freq unrit (2) - 1 freq untie (2) - 2 freq unit (2) - 42 freq onli (2) - 40 freq manlik (2) - 1 freq lik (2) - 1638 freq dunlin (2) - 2 freq usli (2) - 1 freq €˜lik (2) - 1 freq unlæk (2) - 1 freq anlie (2) - 15 freq uni (2) - 53 freq |
unlik (0) - 1 freq unlike (1) - 43 freq unalik (1) - 3 freq unalike (2) - 12 freq onalik (2) - 1 freq inlaik (2) - 1 freq unlaek (2) - 3 freq unlik' (2) - 1 freq malik (3) - 34 freq manlik (3) - 1 freq anlie (3) - 15 freq onlyke (3) - 2 freq onlie (3) - 102 freq onli (3) - 40 freq 'lik (3) - 3 freq lik (3) - 1638 freq unk (3) - 1 freq oonlike (3) - 1 freq unlock (3) - 7 freq clok (4) - 2 freq saelik (4) - 1 freq laik (4) - 62 freq inlack (4) - 1 freq llike (4) - 1 freq unlikely (4) - 22 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 - UNLK unlucky - 29 freq unlock - 7 freq unlike - 43 freq unalik - 3 freq unlik - 1 freq unalike - 12 freq unlik' - 1 freq unlaek - 3 freq €¦unlike - 1 freq unloack - 1 freq unlæk - 1 freq |
UNLIK |
| Time to execute Levenshtein function - 0.430970 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.599954 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.071036 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.041016 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.000942 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. |