| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| swackenin (0) - 1 freq sickenin (2) - 4 freq wakkenin (2) - 2 freq wakenin (2) - 2 freq waakenin (2) - 2 freq waukenin (2) - 7 freq slockenin (2) - 2 freq blackenin (2) - 2 freq awakenin (2) - 2 freq awaukenin (2) - 3 freq seekenin (3) - 1 freq snickerin (3) - 5 freq racketin (3) - 1 freq stackin (3) - 2 freq stachenn (3) - 1 freq blakkenin (3) - 1 freq swalaein (3) - 1 freq waakenan (3) - 1 freq sturkenin (3) - 2 freq hearkenin (3) - 2 freq swaggerin (3) - 5 freq sharpenin (3) - 3 freq daarkenin (3) - 1 freq spakein (3) - 1 freq knackerin (3) - 1 freq |
swackenin (0) - 1 freq sickenin (3) - 4 freq slockenin (3) - 2 freq blackenin (4) - 2 freq swickin (4) - 5 freq awakenin (4) - 2 freq awaukenin (4) - 3 freq wakkenin (4) - 2 freq waukenin (4) - 7 freq wakenin (4) - 2 freq waakenin (4) - 2 freq sackin (5) - 4 freq swacker (5) - 1 freq wackened (5) - 1 freq weakenin (5) - 2 freq sickening (5) - 2 freq wackin (5) - 1 freq swackeries (5) - 1 freq shackin (5) - 1 freq smickerin (5) - 2 freq smackin (5) - 4 freq slackened (5) - 2 freq spackin (5) - 5 freq quickenin (5) - 1 freq swackest (5) - 2 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 - SWKNN swackenin - 1 freq |
SWACKENIN |
| Time to execute Levenshtein function - 0.212801 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.394836 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.027451 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.038800 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.000886 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. |