| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unwelcum (0) - 1 freq welcum (2) - 10 freq unwelcome (2) - 7 freq unwalcom (2) - 1 freq unwalcome (3) - 3 freq welcom (3) - 1 freq unweicome (3) - 1 freq €œwalcum (3) - 2 freq weilcum (3) - 11 freq undercut (3) - 1 freq walcum (3) - 31 freq owercum (3) - 6 freq weltum (3) - 1 freq unnertuk (4) - 7 freq becum (4) - 24 freq upcum (4) - 2 freq angelus (4) - 1 freq powercut (4) - 1 freq baecum (4) - 3 freq incum (4) - 1 freq unnercuts (4) - 1 freq fowersum (4) - 3 freq angelou (4) - 2 freq blellum (4) - 2 freq unweshed (4) - 1 freq |
unwelcum (0) - 1 freq unwelcome (2) - 7 freq unwalcom (2) - 1 freq welcum (3) - 10 freq unwalcome (3) - 3 freq walcum (4) - 31 freq weilcum (4) - 11 freq welcom (4) - 1 freq unweicome (4) - 1 freq walcom (5) - 3 freq weelcam (5) - 2 freq 'welcome (5) - 6 freq welcome (5) - 168 freq owercum (5) - 6 freq weltum (5) - 1 freq €œwalcum (5) - 2 freq owrecum (6) - 3 freq willum (6) - 5 freq angelam (6) - 1 freq wilsum (6) - 1 freq weelum (6) - 5 freq unwieldy (6) - 1 freq 'willum (6) - 1 freq unweel (6) - 2 freq owercam (6) - 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 - UNWLKM unwalcome - 3 freq unwalcom - 1 freq unwelcum - 1 freq unwelcome - 7 freq |
UNWELCUM |
| Time to execute Levenshtein function - 0.338138 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.642973 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.029841 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.096221 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.001087 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. |