Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
scunnerin (0) - 8 freq scunnerin' (1) - 1 freq scunneran (1) - 1 freq scunneris (1) - 1 freq scunners (2) - 11 freq scunner (2) - 97 freq scutterin (2) - 11 freq scunner't (2) - 2 freq sunderin (2) - 1 freq wunnerin (2) - 82 freq scunner's (2) - 1 freq squannerin (2) - 1 freq scunners' (2) - 1 freq daunnerin (2) - 2 freq jaunnerin (2) - 1 freq junnerin (2) - 1 freq dunnerin (2) - 8 freq sinnerin (2) - 2 freq scunnerfu (2) - 1 freq waunnerin (2) - 3 freq plunnerin (2) - 1 freq scunnered (2) - 78 freq unnerin (2) - 1 freq thunnerin (2) - 1 freq saunterin (2) - 5 freq |
scunnerin (0) - 8 freq scunneran (1) - 1 freq scunnerin' (2) - 1 freq scunneris (2) - 1 freq sinnerin (3) - 2 freq scunnerfu (3) - 1 freq squannerin (3) - 1 freq scunnert (3) - 78 freq scunnerd (3) - 5 freq scunnered (3) - 78 freq scunners (3) - 11 freq scunner (3) - 97 freq scunner's (4) - 1 freq saunterin (4) - 5 freq thunnerin (4) - 1 freq scutterin (4) - 11 freq sconnered (4) - 1 freq scunneration (4) - 5 freq scannin (4) - 8 freq secunnert (4) - 1 freq unnerin (4) - 1 freq scunnert- (4) - 1 freq scanner (4) - 1 freq wunnerin (4) - 82 freq scunners' (4) - 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 - SKNRN scunnerin - 8 freq squannèrin - 1 freq squannerin - 1 freq scunneran - 1 freq scunnerin' - 1 freq |
SCUNNERIN |
Time to execute Levenshtein function - 0.283126 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.406370 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.033673 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.046905 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.000816 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. |