| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shimmerin (0) - 12 freq shimmering (1) - 1 freq simmerin (1) - 7 freq skimmerin (1) - 10 freq shiverin (2) - 12 freq shimmer (2) - 4 freq whimperin (2) - 1 freq shivverin (2) - 5 freq vimmerin (2) - 1 freq timmerin (2) - 4 freq simperin (2) - 1 freq haimmerin (2) - 6 freq hemmerin (2) - 7 freq shimeran (2) - 1 freq stimmerie (2) - 1 freq zimmerin (2) - 1 freq hammerin (2) - 18 freq glimmerin (2) - 4 freq shimmered (2) - 2 freq shimmyin (2) - 1 freq sifferin (3) - 3 freq climmeran (3) - 1 freq shatterin (3) - 1 freq skitterin (3) - 11 freq shitein (3) - 2 freq |
shimmerin (0) - 12 freq shimmering (2) - 1 freq skimmerin (2) - 10 freq simmerin (2) - 7 freq hemmerin (3) - 7 freq shimeran (3) - 1 freq haimmerin (3) - 6 freq shimmyin (3) - 1 freq shimmered (3) - 2 freq hammerin (3) - 18 freq shimmer (3) - 4 freq shammin (4) - 1 freq simperin (4) - 1 freq shiverin (4) - 12 freq hammeran (4) - 1 freq glimmerin (4) - 4 freq whimperin (4) - 1 freq vimmerin (4) - 1 freq timmerin (4) - 4 freq stimmerie (4) - 1 freq shivverin (4) - 5 freq zimmerin (4) - 1 freq haimerin (5) - 1 freq simmer (5) - 309 freq skimmen (5) - 1 freq |
SoundEx code - S565 skimmerin - 10 freq saun-rain - 1 freq smorin - 5 freq scunnerin - 8 freq smarmy - 4 freq smuirin - 5 freq sneerin - 2 freq snorin - 19 freq smoorin - 10 freq simmerin - 7 freq snarin - 2 freq shimmerin - 12 freq sneering - 1 freq smirnoff - 6 freq squannèrin - 1 freq shimmering - 1 freq squannerin - 1 freq scunneran - 1 freq sun-waarmed - 1 freq sunwarm - 1 freq shimeran - 1 freq simmer-nicht-lang - 1 freq sneeran - 1 freq schönern - 1 freq smourin - 1 freq sinnerin - 2 freq sneerins - 1 freq smearin - 1 freq smirnie - 1 freq scunnerin' - 1 freq smarmin - 1 freq smoarin' - 1 freq smorning - 1 freq |
MetaPhone code - XMRN shimmerin - 12 freq shimeran - 1 freq |
SHIMMERIN |
| Time to execute Levenshtein function - 0.267580 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.399135 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.027629 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.040648 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.000819 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. |