| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unbeatable (0) - 2 freq unbearable (1) - 2 freq unbrakable (2) - 1 freq unreadable (2) - 2 freq unreliable (3) - 2 freq undeniable (3) - 2 freq debatable (3) - 1 freq unkennable (3) - 3 freq unspeakable (3) - 2 freq repeatable (3) - 1 freq unsuitable (3) - 2 freq inflatable (3) - 2 freq unreachable (3) - 2 freq unevytable (3) - 2 freq unbrekkable (3) - 1 freq unstable (3) - 1 freq unmutable (3) - 1 freq unlearnable (3) - 1 freq unmendable (3) - 1 freq bearable (3) - 5 freq unbelievable (4) - 8 freq relatable (4) - 3 freq timetable (4) - 13 freq inimitable (4) - 1 freq incapable (4) - 7 freq |
unbeatable (0) - 2 freq unbearable (2) - 2 freq unevytable (4) - 2 freq unsuitable (4) - 2 freq unmutable (4) - 1 freq debatable (4) - 1 freq unstable (4) - 1 freq unreadable (4) - 2 freq unbrakable (4) - 1 freq inimitable (5) - 1 freq bearable (5) - 5 freq inevitable (5) - 29 freq insatiable (5) - 4 freq habitable (5) - 4 freq notable (5) - 5 freq repeatable (5) - 1 freq undeniable (5) - 2 freq inflatable (5) - 2 freq unreliable (5) - 2 freq enjeyable (6) - 1 freq unable (6) - 19 freq unviable (6) - 1 freq tea-table (6) - 1 freq unjoukable (6) - 2 freq uncountable (6) - 1 freq |
SoundEx code - U513 unbathert - 1 freq unbidden - 6 freq unbuttonin - 1 freq unevytable - 2 freq umpteenth - 9 freq umpteen - 15 freq unbooed - 1 freq unboadied - 1 freq unfaddomed - 1 freq unfathomably - 1 freq unbitter - 1 freq unbeatable - 2 freq unpattrened - 2 freq unfaddomable - 1 freq unbuttoned - 4 freq unfettered - 2 freq unfaithful - 2 freq unbodie't - 3 freq unavoydable - 1 freq unbutton - 2 freq unpatentit - 1 freq unhappt - 1 freq unbowed - 1 freq unmouped - 1 freq unavoidable - 3 freq unmapped - 1 freq unified - 3 freq unbothered - 1 freq unbiddan - 1 freq unpaid - 3 freq unfit - 1 freq |
MetaPhone code - UNBTBL unbeatable - 2 freq |
UNBEATABLE |
| Time to execute Levenshtein function - 0.214283 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.401908 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.027986 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.037320 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.001022 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. |