| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unstoppable (0) - 5 freq unstappable (1) - 2 freq unsociable (3) - 2 freq unsolvable (3) - 1 freq unstable (3) - 1 freq untholeable (4) - 1 freq unavoydable (4) - 1 freq unsinkable (4) - 1 freq unspaekable (4) - 2 freq unavoidable (4) - 3 freq unjoukable (4) - 2 freq unshiftable (4) - 1 freq untholable (4) - 1 freq unspikkable (4) - 1 freq untouchable (4) - 3 freq stoppage (4) - 1 freq unsmuirable (4) - 1 freq unspeakable (4) - 2 freq unsuitable (4) - 2 freq unevytable (5) - 2 freq constable (5) - 24 freq stable (5) - 71 freq adappable (5) - 1 freq unroyalle (5) - 1 freq notable (5) - 5 freq |
unstoppable (0) - 5 freq unstappable (1) - 2 freq unstable (5) - 1 freq unspeakable (6) - 2 freq unspaekable (6) - 2 freq unsuitable (6) - 2 freq unsolvable (6) - 1 freq unsociable (6) - 2 freq untholeable (7) - 1 freq unsmuirable (7) - 1 freq insatiable (7) - 4 freq unseparably (7) - 1 freq unstappin (7) - 1 freq inseparable (7) - 5 freq stoppage (7) - 1 freq unstappit (7) - 2 freq unshiftable (7) - 1 freq inescapable (7) - 2 freq unsinkable (7) - 1 freq untouchable (7) - 3 freq untholable (7) - 1 freq unspikkable (7) - 1 freq stoppe (8) - 1 freq questionable (8) - 3 freq unsurpassable (8) - 1 freq |
SoundEx code - U523 unsettl't - 2 freq unquateness - 1 freq uncut - 1 freq unsteady - 3 freq unsettled - 3 freq uncouthie - 3 freq unstringin - 1 freq unstoppable - 5 freq unsettlin - 3 freq unsettle - 1 freq un-yeesed - 1 freq unsaed - 1 freq ungoadly - 1 freq unskaithd - 1 freq unsettles - 1 freq unheuked - 1 freq unsaid - 6 freq unsteik - 1 freq unsteikit - 1 freq unsheathit - 1 freq 'unsteik - 1 freq unstappit - 2 freq unsticking - 1 freq unsettling - 3 freq unmistakable - 3 freq unwashed - 5 freq unkit's - 1 freq unhooked - 1 freq unasked-for - 1 freq uncouth - 5 freq unmistakeable - 3 freq unsatisfied - 1 freq unsuitable - 2 freq unwashit - 1 freq unsteeked - 1 freq unstuck - 1 freq unstick - 1 freq unctioneer - 2 freq unstaundart - 2 freq unst - 12 freq unstitute - 1 freq unsteek - 3 freq ungat - 1 freq unstapt - 1 freq unsheddied - 1 freq unshadowed - 1 freq unstable - 1 freq unsatisfactorie - 1 freq unwasht - 1 freq unsteekit - 2 freq unwaashed - 1 freq unstappable - 2 freq unstressed - 27 freq unstessed - 1 freq unquait - 1 freq unction - 1 freq unwaged - 1 freq unsattled - 1 freq unstintin - 1 freq unsturdy - 1 freq ungodly - 2 freq unsatisfactor - 1 freq uncuddomt - 1 freq unstappin - 1 freq unstickan - 1 freq unmistakible - 1 freq unhowkit - 1 freq unused - 2 freq unstintit - 1 freq unctuous - 1 freq unsaturatit - 1 freq unweshed - 1 freq unsteeks - 1 freq unscathed - 2 freq unsatisfaiän - 1 freq ungwdrj - 1 freq unstfest - 1 freq unstagram - 1 freq unmasked - 1 freq unistrathclyde - 1 freq unsteddy - 1 freq unstlass - 3 freq |
MetaPhone code - UNSTPBL unstoppable - 5 freq unstappable - 2 freq |
UNSTOPPABLE stop - 521 freq stap - 293 freq stapped - 121 freq stappit - 117 freq stappin - 45 freq staps - 36 freq stapt - 30 freq stappt - 5 freq stappit-fu - 3 freq stap-stairt - 2 freq stopped - 158 freq stoppit - 100 freq stops - 44 freq stoppin - 47 freq stopt - 5 freq stoppt - 11 freq stopping - 3 freq unstoppable - 5 freq stop' - freq stopper - 2 freq |
| Time to execute Levenshtein function - 0.225907 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.417194 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.034222 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.039113 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.001244 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. |