| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unmutable (0) - 1 freq unsuitable (2) - 2 freq unstable (2) - 1 freq immutable (2) - 1 freq unevytable (3) - 2 freq timetable (3) - 13 freq inimitable (3) - 1 freq unbeatable (3) - 2 freq unviable (3) - 1 freq incurable (3) - 1 freq reputable (3) - 3 freq tim'table (3) - 8 freq notable (3) - 5 freq unsmuirable (3) - 1 freq unjoukable (3) - 2 freq uncountable (3) - 1 freq unmendable (3) - 1 freq unable (3) - 19 freq unmissable (3) - 2 freq 'notable (3) - 1 freq unmistakible (4) - 1 freq enjoyable (4) - 7 freq notably (4) - 7 freq unmistakable (4) - 3 freq undeniable (4) - 2 freq |
unmutable (0) - 1 freq unsuitable (3) - 2 freq immutable (3) - 1 freq inimitable (3) - 1 freq unstable (3) - 1 freq unevytable (4) - 2 freq unbeatable (4) - 2 freq notable (4) - 5 freq timetable (4) - 13 freq 'notable (5) - 1 freq insatiable (5) - 4 freq unable (5) - 19 freq inevitable (5) - 29 freq unmendable (5) - 1 freq indomitable (5) - 1 freq notably (5) - 7 freq unmissable (5) - 2 freq incurable (5) - 1 freq uncountable (5) - 1 freq reputable (5) - 3 freq tim'table (5) - 8 freq unsmuirable (5) - 1 freq unjoukable (5) - 2 freq unviable (5) - 1 freq unsociable (6) - 2 freq |
SoundEx code - U531 undevaulin - 3 freq undeflected - 1 freq undoubted - 1 freq untape - 1 freq undividit - 1 freq untappit - 1 freq undoubtedly - 3 freq unhidebound - 1 freq unmutable - 1 freq undevalin - 1 freq undefeated - 1 freq untappd - 1 freq |
MetaPhone code - UNMTBL unmutable - 1 freq |
UNMUTABLE |
| Time to execute Levenshtein function - 0.238661 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.392417 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.028080 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.037031 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.000862 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. |