Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
noticeably (0) - 1 freq noticeable (1) - 2 freq noticable (2) - 1 freq notably (3) - 7 freq noticet (4) - 1 freq notices (4) - 16 freq paceably (4) - 1 freq paeceably (4) - 2 freq notional (4) - 1 freq notable (4) - 5 freq notican (4) - 1 freq noticed (4) - 227 freq notice (4) - 175 freq logically (4) - 2 freq notice't (4) - 8 freq sonically (4) - 1 freq nicely (4) - 16 freq voicemail (5) - 4 freq initially (5) - 4 freq moveable (5) - 1 freq conceals (5) - 1 freq nicey (5) - 3 freq entirely (5) - 31 freq continually (5) - 6 freq manically (5) - 1 freq |
noticeably (0) - 1 freq noticeable (1) - 2 freq noticable (2) - 1 freq notably (4) - 7 freq notable (5) - 5 freq notican (6) - 1 freq noticed (6) - 227 freq nicely (6) - 16 freq notice (6) - 175 freq notice't (6) - 8 freq notional (6) - 1 freq noticet (6) - 1 freq notices (6) - 16 freq paeceably (6) - 2 freq paceably (6) - 1 freq traceable (7) - 1 freq neurotically (7) - 1 freq forcibly (7) - 2 freq equitably (7) - 2 freq suitably (7) - 3 freq peacably (7) - 1 freq naitrally (7) - 1 freq noticin (7) - 20 freq inevitably (7) - 10 freq notict (7) - 1 freq |
SoundEx code - N321 noticeable - 2 freq nutjobs - 2 freq noticable - 1 freq notice-board - 1 freq nedspeak - 5 freq noticeably - 1 freq needs-foondit - 1 freq €œnedspeak - 1 freq ntcvq - 1 freq natgeophotos - 1 freq |
MetaPhone code - NTSBL noticeable - 2 freq noticeably - 1 freq |
NOTICEABLY |
Time to execute Levenshtein function - 0.219370 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.348020 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.032770 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.038055 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.000905 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. |