| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snorin (0) - 19 freq scorin (1) - 6 freq smorin (1) - 5 freq snarin (1) - 2 freq snortin (1) - 13 freq snokin (1) - 2 freq snowin (1) - 4 freq snorkin (1) - 1 freq shorin (1) - 1 freq storin (1) - 1 freq showin (2) - 76 freq florin (2) - 4 freq snuvin (2) - 2 freq nosin (2) - 2 freq snorl (2) - 21 freq spirin (2) - 1 freq stowin (2) - 6 freq starin (2) - 156 freq saurin (2) - 1 freq morin (2) - 2 freq stoorin (2) - 2 freq smoorin (2) - 10 freq sorn (2) - 28 freq poorin (2) - 45 freq shorie (2) - 2 freq |
snorin (0) - 19 freq snarin (1) - 2 freq sneerin (2) - 2 freq shorin (2) - 1 freq storin (2) - 1 freq snowin (2) - 4 freq snorkin (2) - 1 freq snokin (2) - 2 freq scorin (2) - 6 freq smorin (2) - 5 freq snortin (2) - 13 freq snorry (3) - 1 freq sworn (3) - 13 freq skorn (3) - 1 freq smourin (3) - 1 freq swirin (3) - 1 freq snores (3) - 6 freq skyrin (3) - 1 freq soarin (3) - 9 freq snortan (3) - 2 freq stourin (3) - 6 freq scorn (3) - 18 freq sovrin (3) - 1 freq scoorin (3) - 2 freq snorlie (3) - 1 freq |
SoundEx code - S565 skimmerin - 11 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 - SNRN saun-rain - 1 freq sneerin - 2 freq snorin - 19 freq snarin - 2 freq sneeran - 1 freq sinnerin - 2 freq |
SNORIN |
| Time to execute Levenshtein function - 0.600890 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.933181 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.085671 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.093023 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.000943 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. |