| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| notict (0) - 1 freq noticet (1) - 1 freq notit (1) - 13 freq noticd (1) - 1 freq notice (1) - 175 freq dotit (2) - 1 freq nottit (2) - 3 freq notiece (2) - 2 freq notin (2) - 6 freq notion (2) - 223 freq notid (2) - 1 freq notch (2) - 6 freq nott (2) - 55 freq notices (2) - 16 freq 'notice (2) - 1 freq noticin (2) - 20 freq novice (2) - 5 freq sovict (2) - 1 freq noties (2) - 2 freq nottice (2) - 4 freq noticed (2) - 227 freq notyst (2) - 2 freq votit (2) - 42 freq notis (2) - 1 freq notican (2) - 1 freq |
notict (0) - 1 freq noticet (1) - 1 freq notice (2) - 175 freq noticd (2) - 1 freq notit (2) - 13 freq notice't (3) - 8 freq noticin (3) - 20 freq intact (3) - 14 freq instict (3) - 1 freq notices (3) - 16 freq notyst (3) - 2 freq noticed (3) - 227 freq notch (3) - 6 freq nott (3) - 55 freq notiece (3) - 2 freq nottit (3) - 3 freq notican (3) - 1 freq intit (4) - 11 freq antit (4) - 1 freq tact (4) - 8 freq nutt (4) - 2 freq natch (4) - 2 freq inti't (4) - 1 freq detect (4) - 5 freq nittet (4) - 1 freq |
SoundEx code - N323 neatest - 1 freq noticed - 227 freq notict - 1 freq nithsdale - 7 freq noddy-cuddie - 1 freq notyst - 2 freq nottesed - 1 freq noteyst - 2 freq noteys't - 1 freq notteyst - 1 freq nudgit - 2 freq neediest - 1 freq noteeced - 1 freq notice't - 8 freq nudged - 5 freq naewithstannin - 1 freq nidged - 1 freq noticet - 1 freq notished - 1 freq nudest - 1 freq noteesed - 2 freq notticed - 2 freq neducation - 4 freq nddusty - 1 freq needstisherpinup - 1 freq noticd - 1 freq natashadevan - 1 freq ntcztnv - 1 freq |
MetaPhone code - NTKT notict - 1 freq noddy-cuddie - 1 freq noticd - 1 freq |
NOTICT |
| Time to execute Levenshtein function - 0.221066 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.350761 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.027355 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.037937 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.001031 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. |