| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| notteyst (0) - 1 freq noteyst (1) - 2 freq noteys't (2) - 1 freq notyst (2) - 2 freq hottest (2) - 4 freq contest (3) - 16 freq wettest (3) - 1 freq mostest (3) - 1 freq nittet (3) - 1 freq nattert (3) - 1 freq nolte's (3) - 1 freq nutters (3) - 7 freq dottert (3) - 1 freq softest (3) - 1 freq noreast (3) - 2 freq fittest (3) - 3 freq attest (3) - 2 freq jotters (3) - 23 freq nothers (3) - 1 freq notted (3) - 1 freq nottit (3) - 3 freq snotter't (3) - 1 freq 'otters' (3) - 1 freq cottert (3) - 1 freq neatest (3) - 1 freq |
notteyst (0) - 1 freq noteyst (2) - 2 freq notyst (3) - 2 freq hottest (3) - 4 freq totiest (4) - 1 freq neatest (4) - 1 freq nottit (4) - 3 freq tottiest (4) - 6 freq fattest (4) - 1 freq notts (4) - 20 freq nottesed (4) - 1 freq attest (4) - 2 freq fittest (4) - 3 freq nittet (4) - 1 freq noteys't (4) - 1 freq nattert (4) - 1 freq wettest (4) - 1 freq hottert (5) - 1 freq nutties (5) - 1 freq nor-east (5) - 21 freq note's (5) - 1 freq bottelt (5) - 1 freq notten (5) - 1 freq notysh (5) - 4 freq rottet (5) - 1 freq |
SoundEx code - N323 neatest - 1 freq noticed - 223 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 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 nudgit - 1 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 - 223 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 |
NOTTEYST |
| Time to execute Levenshtein function - 0.294291 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.489285 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.031670 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.080508 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.001117 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. |