Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anonymous (0) - 25 freq synonymous (2) - 2 freq eponymous (2) - 4 freq anonymously (2) - 3 freq anonymise (3) - 1 freq normous (3) - 2 freq enormous (3) - 15 freq unanimous (3) - 2 freq autonomous (3) - 2 freq anonymises (3) - 1 freq anomalous (3) - 1 freq anonymity (3) - 5 freq monymusk (4) - 2 freq annamoly (4) - 1 freq undemous (4) - 6 freq anxious (4) - 54 freq anodynes (4) - 1 freq awmous (4) - 4 freq endonyms (4) - 1 freq dionysius (4) - 1 freq aloysius (4) - 1 freq olympus (4) - 14 freq anyhoos (4) - 13 freq venomous (4) - 1 freq anymore (4) - 14 freq |
anonymous (0) - 25 freq unanimous (3) - 2 freq anonymise (3) - 1 freq anonymously (3) - 3 freq synonymous (3) - 2 freq eponymous (3) - 4 freq autonomous (4) - 2 freq anonymises (4) - 1 freq anonymity (4) - 5 freq normous (4) - 2 freq enormous (4) - 15 freq anonymised (5) - 2 freq endonyms (5) - 1 freq infamous (5) - 7 freq venomous (5) - 1 freq annoys (5) - 4 freq exonyms (5) - 1 freq undeemous (5) - 21 freq undeimous (5) - 8 freq anomalous (5) - 1 freq ondeemous (5) - 1 freq annamoly (5) - 1 freq undemous (5) - 6 freq synonyms (5) - 3 freq innocuous (6) - 1 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 - ANNMS anonymous - 25 freq anonymise - 1 freq |
ANONYMOUS |
Time to execute Levenshtein function - 0.198270 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.409558 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.028208 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.072436 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.000833 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. |