| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| icons (0) - 9 freq vcons (1) - 1 freq cons (1) - 4 freq icon (1) - 10 freq irons (1) - 3 freq ions (1) - 3 freq icin (2) - 10 freq cont (2) - 2 freq scones (2) - 46 freq ihon's (2) - 3 freq con's (2) - 3 freq cogs (2) - 2 freq conns (2) - 1 freq acos (2) - 2 freq roons (2) - 7 freq moons (2) - 28 freq coks (2) - 1 freq vicous (2) - 1 freq fons (2) - 1 freq cones (2) - 2 freq inions (2) - 1 freq schons (2) - 1 freq ipon (2) - 16 freq scows (2) - 1 freq dons (2) - 31 freq |
icons (0) - 9 freq cons (1) - 4 freq cuns (2) - 1 freq consi (2) - 8 freq coins (2) - 50 freq cones (2) - 2 freq cans (2) - 45 freq vcons (2) - 1 freq irons (2) - 3 freq ions (2) - 3 freq icon (2) - 10 freq conn (3) - 14 freq scans (3) - 4 freq yoons (3) - 8 freq hons (3) - 1 freq aeons (3) - 1 freq coos (3) - 71 freq soons (3) - 31 freq toons (3) - 74 freq acorns (3) - 1 freq loons (3) - 175 freq acnse (3) - 1 freq sons (3) - 89 freq cains (3) - 1 freq const (3) - 1 freq |
SoundEx code - I252 icons - 9 freq iconic - 8 freq icing - 8 freq ii'cooncil - 1 freq iconoclastic - 1 freq iconographic-ordert - 1 freq izzens - 1 freq izanagi - 1 freq ismcgr - 9 freq issuing - 1 freq |
MetaPhone code - IKNS icons - 9 freq |
ICONS |
| Time to execute Levenshtein function - 0.215719 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.343553 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.062124 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.037540 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.000878 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. |