| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| issymil (0) - 3 freq sammil (3) - 1 freq stymin (3) - 1 freq t'sykil (3) - 1 freq sybil (3) - 1 freq issit (3) - 1 freq issel (3) - 1 freq issy (3) - 1 freq instil (3) - 1 freq islamic (3) - 1 freq skymin (3) - 1 freq iyil (3) - 9 freq tissil (3) - 1 freq smyril (3) - 1 freq issin (3) - 1 freq stymie (3) - 2 freq assail (3) - 7 freq assumin (3) - 10 freq shamin (4) - 2 freq hissin (4) - 10 freq schmid (4) - 1 freq tsimmit (4) - 1 freq skypit (4) - 1 freq assails (4) - 2 freq rummil (4) - 1 freq |
issymil (0) - 3 freq assumin (4) - 10 freq assail (4) - 7 freq sammil (4) - 1 freq issel (4) - 1 freq assemlie (4) - 7 freq assumed (5) - 12 freq smuil (5) - 1 freq ssl (5) - 1 freq assemmly (5) - 1 freq assemble (5) - 3 freq smyl (5) - 1 freq soshil (5) - 1 freq smile (5) - 458 freq ssm (5) - 1 freq assumes (5) - 4 freq assume (5) - 25 freq fismal (5) - 1 freq assembly (5) - 26 freq assumet (5) - 1 freq psml (5) - 23 freq 'smile (5) - 1 freq assumt (5) - 1 freq simile (5) - 3 freq instil (5) - 1 freq |
SoundEx code - I254 icgml - 1 freq issymil - 3 freq |
MetaPhone code - ISML issymil - 3 freq |
ISSYMIL |
| Time to execute Levenshtein function - 0.201118 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.384701 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.028474 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.039453 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.001030 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. |