Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
noticed (0) - 227 freq noticd (1) - 1 freq notticed (1) - 2 freq noticet (1) - 1 freq notice (1) - 175 freq notices (1) - 16 freq notified (2) - 2 freq oonoticed (2) - 1 freq noteeced (2) - 1 freq notice't (2) - 8 freq notid (2) - 1 freq notican (2) - 1 freq ticed (2) - 2 freq noties (2) - 2 freq notie (2) - 8 freq novice (2) - 5 freq unnoticed (2) - 3 freq notished (2) - 1 freq nouriced (2) - 1 freq notted (2) - 1 freq nottice (2) - 4 freq noticin (2) - 20 freq voiced (2) - 16 freq notioned (2) - 1 freq enticed (2) - 2 freq |
noticed (0) - 227 freq noticd (1) - 1 freq noteeced (2) - 1 freq enticed (2) - 2 freq notices (2) - 16 freq oonoticed (2) - 1 freq notticed (2) - 2 freq notice (2) - 175 freq noticet (2) - 1 freq nouriced (3) - 1 freq noticin (3) - 20 freq notted (3) - 1 freq notict (3) - 1 freq unnoticed (3) - 3 freq notiece (3) - 2 freq notioned (3) - 1 freq noted (3) - 23 freq notican (3) - 1 freq notid (3) - 1 freq notified (3) - 2 freq ticed (3) - 2 freq anoonced (4) - 2 freq fanticed (4) - 1 freq notished (4) - 1 freq untied (4) - 7 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 - NTST neatest - 1 freq noticed - 227 freq notyst - 2 freq nottesed - 1 freq noteyst - 2 freq noteys't - 1 freq notteyst - 1 freq neediest - 1 freq noteeced - 1 freq notice't - 8 freq noticet - 1 freq nudest - 1 freq noteesed - 2 freq notticed - 2 freq nddusty - 1 freq |
NOTICED |
Time to execute Levenshtein function - 0.179919 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.358606 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.028748 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.043033 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.000951 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. |