| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ismcgr (0) - 9 freq smuir (3) - 4 freq smog (3) - 5 freq scar (3) - 16 freq mcr (3) - 1 freq imago (3) - 1 freq smur (3) - 3 freq smear (3) - 2 freq smoar (3) - 1 freq mccr (3) - 1 freq mcg (3) - 3 freq smoor (3) - 28 freq i'car (3) - 1 freq isxcn (3) - 1 freq mcga (3) - 1 freq smaer (3) - 3 freq almcg (3) - 1 freq smig (3) - 1 freq oscar (3) - 8 freq itecrr (3) - 1 freq smirr (3) - 39 freq image (3) - 102 freq smug (3) - 19 freq ishtar (3) - 1 freq asmxr (3) - 1 freq |
ismcgr (0) - 9 freq smacker (5) - 3 freq smirr (5) - 39 freq oscar (5) - 8 freq smig (5) - 1 freq smaar (5) - 2 freq smug (5) - 19 freq smugger (5) - 1 freq smg (5) - 1 freq smacher (5) - 2 freq iamacr (5) - 1 freq scur (5) - 1 freq smaer (5) - 3 freq asmxr (5) - 1 freq almcg (5) - 1 freq smicker (5) - 1 freq smur (5) - 3 freq mcr (5) - 1 freq scar (5) - 16 freq smuir (5) - 4 freq smog (5) - 5 freq mcga (5) - 1 freq smear (5) - 2 freq smoor (5) - 28 freq mcg (5) - 3 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 - ISMKKR ismcgr - 9 freq |
ISMCGR |
| Time to execute Levenshtein function - 0.241727 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.399387 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.028824 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.038609 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.001006 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. |