| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uninterruptit (0) - 2 freq interruptit (2) - 35 freq interruptet (3) - 5 freq interruptin (3) - 10 freq interrupit (3) - 1 freq interruppit (3) - 8 freq unnerratit (4) - 2 freq intteruptit (4) - 1 freq interrupting (4) - 2 freq interrupts (4) - 7 freq interuppit (4) - 1 freq interruption (4) - 5 freq interrupt (4) - 17 freq interruptan (4) - 2 freq interrupted (4) - 33 freq interpretit (5) - 2 freq interactit (5) - 1 freq interrup (5) - 3 freq unnerfuit (5) - 1 freq unnerfundit (5) - 1 freq interstit (5) - 1 freq interestit (5) - 71 freq integratit (5) - 3 freq interrogatit (5) - 1 freq untentit (6) - 1 freq |
uninterruptit (0) - 2 freq interruptit (3) - 35 freq interruptet (4) - 5 freq interruppit (5) - 8 freq interrupit (5) - 1 freq interruptin (5) - 10 freq interrupt (6) - 17 freq interruptan (6) - 2 freq interrupted (6) - 33 freq interruption (6) - 5 freq interrupts (6) - 7 freq unnerratit (6) - 2 freq intteruptit (6) - 1 freq interrogatit (7) - 1 freq interrupting (7) - 2 freq interuppit (7) - 1 freq interestit (8) - 71 freq interstit (8) - 1 freq integratit (8) - 3 freq interactit (8) - 1 freq interrup (8) - 3 freq interpretit (8) - 2 freq corruptit (9) - 2 freq bankruptit (9) - 1 freq internett (9) - 1 freq |
SoundEx code - U553 unendin - 2 freq unmendable - 1 freq unmentionables - 1 freq unnamed - 4 freq unwindin - 2 freq unintelligible - 2 freq unintentionally - 2 freq unwanted - 6 freq unintentional - 1 freq unwind - 5 freq unmentionable - 1 freq unnaemed - 1 freq unwantit - 2 freq uninterruptit - 2 freq ummanhood - 1 freq unintellectual - 1 freq unwintit - 3 freq unanticipated - 2 freq unintended - 1 freq €œunmanned - 1 freq unmaintained - 1 freq |
MetaPhone code - UNNTRPTT uninterruptit - 2 freq |
UNINTERRUPTIT |
| Time to execute Levenshtein function - 0.249399 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.420621 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.029523 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.039067 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.001107 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. |