| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| signin (0) - 22 freq sighin (1) - 20 freq signins (1) - 2 freq sinnin (1) - 2 freq signing (1) - 12 freq signit (1) - 9 freq mignin (1) - 1 freq sichin (2) - 8 freq sinn (2) - 207 freq rinnin (2) - 331 freq sizin (2) - 5 freq sivin (2) - 4 freq rinin (2) - 2 freq dinin (2) - 25 freq diggin (2) - 44 freq signer (2) - 2 freq tirnin (2) - 5 freq siffin (2) - 1 freq saggin (2) - 3 freq finnin (2) - 40 freq giggin (2) - 2 freq seenin (2) - 1 freq minin (2) - 26 freq sunnin (2) - 5 freq siftin (2) - 2 freq |
signin (0) - 22 freq signit (2) - 9 freq signing (2) - 12 freq mignin (2) - 1 freq sinnin (2) - 2 freq sighin (2) - 20 freq signins (2) - 2 freq signal (3) - 30 freq shinin (3) - 77 freq ginin (3) - 1 freq sennin (3) - 12 freq signs (3) - 151 freq sunnin (3) - 5 freq sainin (3) - 4 freq signet (3) - 3 freq soghin (3) - 1 freq sinnie (3) - 1 freq shonin (3) - 1 freq designin (3) - 1 freq sign (3) - 381 freq seignie (3) - 1 freq sounin (3) - 8 freq signed (3) - 74 freq resignin (3) - 2 freq shynin (3) - 1 freq |
SoundEx code - S255 signin - 22 freq seasonin - 1 freq six-man - 1 freq sagamen - 1 freq segment - 1 freq seekenin - 1 freq sign-oan - 1 freq sizzonin - 1 freq seeknin - 2 freq sickenin - 4 freq signin-up - 1 freq saisoneen - 1 freq segments - 2 freq sickening - 2 freq €˜sickening - 1 freq €˜signin - 1 freq swackenin - 1 freq signing - 12 freq signings - 8 freq signins - 2 freq susaninlangside - 1 freq suzannemagowan - 1 freq susannahmacneil - 1 freq |
MetaPhone code - SKNN signin - 22 freq scannin - 8 freq seekenin - 1 freq seeknin - 2 freq scannan - 1 freq sickenin - 4 freq skinnin - 3 freq €˜signin - 1 freq |
SIGNIN |
| Time to execute Levenshtein function - 0.203371 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.341426 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.027135 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.037086 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.000901 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. |