| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| swarmin (0) - 6 freq swairmin (1) - 2 freq warmin (1) - 30 freq smarmin (1) - 1 freq starin (2) - 156 freq saemin (2) - 1 freq warming (2) - 3 freq swayin (2) - 5 freq swirlin (2) - 21 freq starrin (2) - 3 freq staemin (2) - 1 freq swervin (2) - 1 freq soartin (2) - 5 freq swallin (2) - 11 freq waamin (2) - 1 freq shammin (2) - 1 freq stormin (2) - 7 freq snarlin (2) - 9 freq sarvin (2) - 22 freq wartin (2) - 1 freq startin (2) - 97 freq sware-in (2) - 1 freq swannin (2) - 2 freq warnin (2) - 92 freq sharein (2) - 1 freq |
swarmin (0) - 6 freq swairmin (1) - 2 freq smarmin (2) - 1 freq warmin (2) - 30 freq swimmin (3) - 63 freq warman (3) - 2 freq sworlin (3) - 1 freq swirin (3) - 1 freq swearin (3) - 16 freq swarm (3) - 2 freq waarmin (3) - 7 freq swurlin (3) - 1 freq sweemin (3) - 32 freq sware-in (3) - 1 freq swarms (3) - 2 freq swarmed (3) - 1 freq wairmin (3) - 2 freq swervin (3) - 1 freq stormin (3) - 7 freq swirlin (3) - 21 freq wardin (4) - 1 freq dwaumin (4) - 3 freq skartin (4) - 4 freq warming (4) - 3 freq saemin (4) - 1 freq |
SoundEx code - S655 surmoontit - 1 freq sermon - 29 freq screamin - 73 freq surnem - 2 freq surnames - 4 freq swarmin - 6 freq scrannin - 6 freq screaman - 5 freq surname - 12 freq screamin' - 1 freq screaming - 9 freq sherman - 1 freq sermons - 9 freq screaminly - 1 freq scaremongerin - 2 freq squirmin - 3 freq swairmin - 2 freq scrimin - 2 freq sereaman - 1 freq swearin-in - 1 freq surrounnins - 1 freq scorninly - 1 freq scare-mongerin - 1 freq sairmons - 1 freq screening - 1 freq screenin - 2 freq |
MetaPhone code - SWRMN swarmin - 6 freq swairmin - 2 freq |
SWARMIN |
| Time to execute Levenshtein function - 0.213694 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.376120 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.030579 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.040232 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.000959 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. |