| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anomalies (0) - 2 freq anomalous (2) - 1 freq foalies (3) - 1 freq notaries (3) - 2 freq animal's (3) - 5 freq animalism (3) - 12 freq tomaties (3) - 1 freq animals (3) - 112 freq romanies (3) - 1 freq anomaly (3) - 2 freq comatie (4) - 2 freq angeles (4) - 4 freq emilies (4) - 1 freq gnomes (4) - 2 freq animate (4) - 1 freq unhalie (4) - 1 freq nomads (4) - 1 freq ananias (4) - 2 freq apostles (4) - 6 freq boolies (4) - 1 freq scoolies (4) - 1 freq landladies (4) - 1 freq anomoly (4) - 1 freq norskies (4) - 1 freq comelie (4) - 2 freq |
anomalies (0) - 2 freq anomalous (2) - 1 freq animals (3) - 112 freq anomaly (4) - 2 freq animuls (4) - 1 freq ainimals (4) - 4 freq animalism (4) - 12 freq animal's (4) - 5 freq annuals (5) - 2 freq inemies (5) - 3 freq mailies (5) - 1 freq faimilies (5) - 43 freq females (5) - 9 freq nominees (5) - 2 freq faimlies (5) - 47 freq angles (5) - 29 freq inhales (5) - 1 freq inimities (5) - 1 freq anglais (5) - 2 freq enemies (5) - 37 freq anemones (5) - 2 freq animal (5) - 101 freq inmates (5) - 1 freq annals (5) - 5 freq femlies (5) - 2 freq |
SoundEx code - A554 animals - 112 freq animal - 101 freq animalism - 12 freq ainimals - 4 freq anomaly - 2 freq anomoly - 1 freq animal's - 5 freq anomalies - 2 freq animal-or - 1 freq anomalous - 1 freq animuls - 1 freq ainimal - 1 freq animal-lookin - 1 freq annoyinly - 1 freq animalcrossing - 1 freq annamoly - 1 freq |
MetaPhone code - ANMLS animals - 112 freq ainimals - 4 freq animal's - 5 freq anomalies - 2 freq anomalous - 1 freq animuls - 1 freq |
ANOMALIES |
| Time to execute Levenshtein function - 0.200005 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.371535 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.027475 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.036945 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.000881 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. |