| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anonymity (0) - 5 freq anonymise (2) - 1 freq enormity (3) - 3 freq annuity (3) - 2 freq anonymised (3) - 2 freq anonymous (3) - 25 freq anonymises (3) - 1 freq magnanimity (4) - 1 freq amity (4) - 2 freq anomaly (4) - 2 freq anomoly (4) - 1 freq infirmity (4) - 2 freq nobility (4) - 11 freq enmity (4) - 4 freq monority (4) - 1 freq onywiy (4) - 2 freq antiquity (4) - 2 freq anointit (4) - 2 freq annamoly (4) - 1 freq canongait (4) - 1 freq anywiy (4) - 2 freq anyntit (4) - 1 freq analysit (4) - 1 freq onywuty (4) - 1 freq proximity (4) - 3 freq |
anonymity (0) - 5 freq anonymise (3) - 1 freq anonymous (4) - 25 freq annuity (4) - 2 freq enormity (4) - 3 freq anointit (5) - 2 freq annamoly (5) - 1 freq anyntit (5) - 1 freq inanimate (5) - 2 freq anonymises (5) - 1 freq anonymised (5) - 2 freq enmity (5) - 4 freq inanimitie (5) - 1 freq naemit (6) - 1 freq ennit (6) - 2 freq annette (6) - 1 freq annum (6) - 2 freq annoyt (6) - 5 freq annint (6) - 1 freq innit (6) - 10 freq ninety (6) - 33 freq anoint (6) - 1 freq dynamite (6) - 7 freq anent (6) - 516 freq anenst (6) - 52 freq |
SoundEx code - A555 anemones - 2 freq anemone's - 1 freq anonymous - 25 freq amenments - 1 freq anonymously - 3 freq anonymity - 5 freq anonymises - 1 freq anonymise - 1 freq anonymised - 2 freq ane-wumman - 1 freq ae-ane-yin-wan - 1 freq aimeeannenaylor - 119 freq aneyinwan - 7 freq |
MetaPhone code - ANNMT anonymity - 5 freq |
ANONYMITY |
| Time to execute Levenshtein function - 0.217718 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.345703 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.027642 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.045881 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.001099 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. |