| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sizzonin (0) - 1 freq sizzlin (2) - 5 freq dizzin (3) - 1 freq soonin (3) - 1 freq sizzie (3) - 1 freq mizzlin (3) - 2 freq rizzon (3) - 8 freq shonin (3) - 1 freq kizzin (3) - 1 freq vizzyin (3) - 1 freq mizzigin (3) - 1 freq sizzlen (3) - 1 freq sizzens (3) - 8 freq sizzent (3) - 1 freq stoonin (3) - 7 freq sizzen (3) - 3 freq bizzin (3) - 17 freq sizin (3) - 5 freq sirloin (3) - 7 freq fizzin (3) - 8 freq sickenin (3) - 4 freq signin (3) - 22 freq seasonin (3) - 1 freq sinnin (3) - 2 freq dizzyin (3) - 1 freq |
sizzonin (0) - 1 freq sizzlin (3) - 5 freq sizzen (4) - 3 freq sizzent (4) - 1 freq sizzens (4) - 8 freq sizzlen (4) - 1 freq sinnin (5) - 2 freq signin (5) - 22 freq sickenin (5) - 4 freq seasonin (5) - 1 freq rizzin (5) - 1 freq swoonin (5) - 2 freq sizzling (5) - 1 freq mezzanine (5) - 3 freq pizenin (5) - 1 freq summonin (5) - 1 freq fizzin (5) - 8 freq sinnonie (5) - 1 freq dizzyin (5) - 1 freq cizzin (5) - 1 freq rizzon (5) - 8 freq shonin (5) - 1 freq soonin (5) - 1 freq mizzlin (5) - 2 freq sizzie (5) - 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 - SSNN seasonin - 1 freq sizzonin - 1 freq saisoneen - 1 freq |
SIZZONIN |
| Time to execute Levenshtein function - 0.352653 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.628928 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.068802 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.047252 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.001209 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. |