Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
neducation (0) - 4 freq education (1) - 415 freq 'education (1) - 2 freq reduction (2) - 3 freq seduction (2) - 2 freq medication (2) - 8 freq educatioun (2) - 7 freq dedication (2) - 8 freq educatin (2) - 4 freq edication (2) - 3 freq eductaion (3) - 1 freq eaceducation (3) - 17 freq federation (3) - 3 freq uneducatit (3) - 2 freq mediation (3) - 4 freq dedicatin (3) - 2 freq reputation (3) - 30 freq abdication (3) - 1 freq educational (3) - 55 freq educating (3) - 1 freq re-education (3) - 3 freq induction (3) - 2 freq aduration (3) - 1 freq refutation (3) - 1 freq equation (3) - 5 freq |
neducation (0) - 4 freq 'education (2) - 2 freq education (2) - 415 freq edication (3) - 3 freq indication (3) - 4 freq induction (3) - 2 freq educatin (3) - 4 freq dedication (3) - 8 freq seduction (3) - 2 freq reduction (3) - 3 freq medication (3) - 8 freq educatioun (3) - 7 freq indicatin (4) - 8 freq dedicatioun (4) - 1 freq eddication (4) - 51 freq abduction (4) - 1 freq abdication (4) - 1 freq uneducatit (4) - 2 freq eaceducation (4) - 17 freq dedicatin (4) - 2 freq eductaion (4) - 1 freq uneducated (5) - 2 freq eddicatin (5) - 1 freq abductin (5) - 1 freq eruction (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 - NTKXN neducation - 4 freq |
NEDUCATION |
Time to execute Levenshtein function - 0.326760 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.781221 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.029973 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.087487 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.000867 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. |