| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unless (0) - 137 freq 'unless (1) - 4 freq sunless (1) - 1 freq enless (1) - 12 freq usless (1) - 1 freq onless (1) - 7 freq unrest (2) - 6 freq ness (2) - 41 freq kness (2) - 1 freq tuneless (2) - 2 freq useless (2) - 36 freq dinless (2) - 1 freq 'aless (2) - 1 freq unkens (2) - 1 freq aless (2) - 26 freq wutless (2) - 1 freq oonless (2) - 4 freq winless (2) - 1 freq undress (2) - 2 freq 'less (2) - 1 freq bounless (2) - 1 freq cless (2) - 116 freq €˜less (2) - 1 freq kinless (2) - 1 freq muinless (2) - 4 freq |
unless (0) - 137 freq enless (1) - 12 freq onless (1) - 7 freq 'unless (2) - 4 freq sunless (2) - 1 freq oonless (2) - 4 freq usless (2) - 1 freq giless (3) - 4 freq bless (3) - 42 freq onles (3) - 2 freq muinless (3) - 4 freq endless (3) - 51 freq guiless (3) - 1 freq cenless (3) - 1 freq sounless (3) - 2 freq gless (3) - 392 freq kless (3) - 1 freq unleash (3) - 2 freq less (3) - 539 freq kinless (3) - 1 freq uisless (3) - 6 freq haunless (3) - 3 freq rueless (3) - 1 freq wanless (3) - 3 freq aless (3) - 26 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 - UNLS unless - 137 freq 'unless - 4 freq |
UNLESS |
| Time to execute Levenshtein function - 0.216813 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.384441 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.029086 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.043525 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.000841 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. |