| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| secunnert (0) - 1 freq seunnert (1) - 2 freq scunnert (1) - 79 freq scunnert- (2) - 1 freq scunner (2) - 97 freq staunnert (2) - 4 freq scunners (2) - 12 freq stunnert (2) - 1 freq scunnerd (2) - 5 freq skunnert (2) - 1 freq scunner't (2) - 2 freq skunner (3) - 3 freq dunnert (3) - 1 freq stannert (3) - 3 freq founnert (3) - 1 freq scuppert (3) - 1 freq sinnert (3) - 1 freq skunners (3) - 2 freq scunnerin (3) - 8 freq scuttert (3) - 3 freq scunder (3) - 1 freq sauntert (3) - 1 freq hunnert (3) - 14 freq reconnect (3) - 2 freq scunnered (3) - 79 freq |
secunnert (0) - 1 freq scunnert (1) - 79 freq seunnert (2) - 2 freq skunnert (3) - 1 freq scunner't (3) - 2 freq stunnert (3) - 1 freq scunnerd (3) - 5 freq scunners (3) - 12 freq scunner (3) - 97 freq staunnert (3) - 4 freq scunnert- (3) - 1 freq scanner (4) - 1 freq staunnart (4) - 6 freq scunneran (4) - 1 freq scunnerin (4) - 8 freq scunneris (4) - 1 freq scunnered (4) - 79 freq sinnert (4) - 1 freq stannert (4) - 3 freq scunnerfu (4) - 1 freq thunnert (5) - 2 freq daunnert (5) - 5 freq stunners (5) - 1 freq scunnért (5) - 5 freq sconnered (5) - 1 freq |
SoundEx code - S256 secunnert - 1 freq sycamores - 1 freq sycomore - 1 freq seik-scunnered - 2 freq sycamore - 7 freq signers - 1 freq signorum - 1 freq seigneur - 1 freq sickener - 1 freq signer - 2 freq séigneur - 1 freq |
MetaPhone code - SKNRT scunnert - 79 freq secunnert - 1 freq scunnered - 79 freq scunnért - 5 freq scunner't - 2 freq scunnèrt - 1 freq skunnert - 1 freq sconnered - 1 freq scunnert- - 1 freq €˜scunnert - 3 freq €˜scunnered - 1 freq scunnerred - 1 freq scunnerd - 5 freq |
SECUNNERT |
| Time to execute Levenshtein function - 0.596223 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 - 1.080319 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.028036 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.081244 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.000879 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. |