| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anemones (1) - 2 freq anemone's (2) - 1 freq annone (2) - 1 freq anymore (2) - 14 freq anyone (2) - 67 freq anee (3) - 1 freq achmore (3) - 1 freq leone (3) - 1 freq amore (3) - 1 freq onyone (3) - 23 freq apone (3) - 3 freq commone (3) - 2 freq adeline (3) - 2 freq emond (3) - 1 freq anon (3) - 6 freq annoonce (3) - 4 freq antoni (3) - 1 freq aniline (3) - 9 freq 'demons (3) - 1 freq 'none (3) - 1 freq kiemon (3) - 1 freq neon- (3) - 1 freq lemony (3) - 1 freq anerlie (3) - 68 freq depone (3) - 3 freq |
anemones (2) - 2 freq anymore (3) - 14 freq anyone (3) - 67 freq annone (3) - 1 freq simone (4) - 4 freq undone (4) - 4 freq nemos (4) - 1 freq axemn (4) - 1 freq anen (4) - 49 freq anemia (4) - 1 freq no-one (4) - 3 freq nemme (4) - 9 freq aname (4) - 1 freq none (4) - 57 freq anymare (4) - 17 freq oanyone (4) - 1 freq demon (4) - 23 freq mone (4) - 15 freq inamong (4) - 1 freq amon (4) - 23 freq nomin (4) - 1 freq onyman (4) - 1 freq namin (4) - 7 freq naemin (4) - 1 freq lemon (4) - 23 freq |
SoundEx code - A555 anemones - 2 freq anonymously - 4 freq anemone's - 1 freq anonymous - 25 freq amenments - 1 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 - ANMN |
ANEMONE |
| Time to execute Levenshtein function - 0.209752 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.387915 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.027330 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.037872 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.001242 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. |