| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| radiation (0) - 3 freq radiatin (1) - 3 freq variation (2) - 18 freq mediation (2) - 4 freq radiator (2) - 10 freq tradition (2) - 53 freq graduation (2) - 2 freq radiating (2) - 1 freq tradietion (2) - 1 freq rotation (3) - 1 freq edition (3) - 27 freq reduction (3) - 3 freq addiction (3) - 9 freq tradeition (3) - 28 freq navigation (3) - 2 freq radiators (3) - 3 freq audition (3) - 8 freq dedication (3) - 8 freq redictions (3) - 1 freq recitation (3) - 2 freq animation (3) - 6 freq validation (3) - 2 freq prediction (3) - 6 freq edication (3) - 3 freq graduatin (3) - 2 freq |
radiation (0) - 3 freq radiatin (1) - 3 freq graduation (3) - 2 freq tradition (3) - 53 freq radiating (3) - 1 freq tradietion (3) - 1 freq radiator (3) - 10 freq mediation (3) - 4 freq tradtion (4) - 1 freq rendition (4) - 5 freq addition (4) - 17 freq tradeetion (4) - 71 freq sedition (4) - 7 freq radiates (4) - 3 freq graduatin (4) - 2 freq predation (4) - 1 freq radiated (4) - 1 freq ration (4) - 4 freq relation (4) - 18 freq reduction (4) - 3 freq audition (4) - 8 freq tradeition (4) - 28 freq rotation (4) - 1 freq edition (4) - 27 freq variation (4) - 18 freq |
SoundEx code - R335 rotation - 1 freq rhododendron - 3 freq radiatin - 3 freq road-widenin - 1 freq rhododendrons - 3 freq re-editin - 1 freq rhododenron - 1 freq radiation - 3 freq rotations - 1 freq radiating - 1 freq retweetin - 2 freq retwattin - 1 freq rideouttim - 1 freq retweeting - 1 freq |
MetaPhone code - RTXN rotation - 1 freq radiation - 3 freq |
RADIATION |
| Time to execute Levenshtein function - 0.293615 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.508095 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.028167 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.039846 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.000987 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. |