| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unlikely (0) - 22 freq untimely (2) - 5 freq unlike (2) - 42 freq unlikelie (2) - 1 freq likely (2) - 305 freq unlik (3) - 1 freq uniquely (3) - 4 freq unwieldy (3) - 1 freq unlik' (3) - 1 freq lik'ly (3) - 1 freq sublimely (3) - 1 freq politely (3) - 27 freq entirely (3) - 31 freq lakely (3) - 2 freq unalike (3) - 12 freq -lkely (3) - 1 freq nicely (3) - 16 freq likey (3) - 1 freq unluckily (3) - 1 freq likly (3) - 20 freq unkindly (3) - 1 freq lively (3) - 10 freq likkly (3) - 2 freq unweel (4) - 2 freq until (4) - 477 freq |
unlikely (0) - 22 freq unlikelie (2) - 1 freq likely (3) - 305 freq unlike (3) - 42 freq -lkely (4) - 1 freq unluckily (4) - 1 freq onlykelie (4) - 1 freq unalike (4) - 12 freq likly (4) - 20 freq lakely (4) - 2 freq unlik' (4) - 1 freq unlik (4) - 1 freq untimely (4) - 5 freq oonlike (5) - 1 freq lukuly (5) - 2 freq likelie (5) - 11 freq unlaek (5) - 3 freq blekly (5) - 1 freq lekly (5) - 2 freq nikola (5) - 3 freq onrlkly (5) - 3 freq unkil (5) - 4 freq nilly (5) - 1 freq -lekly (5) - 1 freq unalik (5) - 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 - UNLKL unlikely - 22 freq unluckily - 1 freq unlikelie - 1 freq |
UNLIKELY |
| Time to execute Levenshtein function - 0.194079 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.356477 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.028587 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.038569 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.000892 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. |