| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sleepoversrock (0) - 1 freq sleepover (5) - 1 freq leverock (6) - 1 freq sleepers (6) - 4 freq sleeper (7) - 2 freq caerlaverock (7) - 2 freq laverock (7) - 14 freq leftovers (7) - 3 freq thereiversroad (7) - 2 freq slevers (7) - 2 freq livestock (7) - 6 freq sleeves (7) - 27 freq sleep-ower (7) - 1 freq lovesick (7) - 2 freq sleepless (7) - 7 freq spokesfolk (7) - 1 freq sleepiness (7) - 1 freq sleeveless (8) - 1 freq sneckie-snack (8) - 1 freq slaetero's (8) - 6 freq sherrick (8) - 2 freq slaetero (8) - 2 freq sheeptick (8) - 1 freq sleep's (8) - 1 freq laverick (8) - 1 freq |
sleepoversrock (0) - 1 freq sleepover (9) - 1 freq sleepers (10) - 4 freq leverock (10) - 1 freq livestock (11) - 6 freq lovesick (11) - 2 freq slevers (11) - 2 freq slapstick (11) - 1 freq silverback (11) - 2 freq laverock (11) - 14 freq lerrick (12) - 4 freq slopers (12) - 1 freq parrock (12) - 2 freq sulphurick (12) - 1 freq slippers (12) - 16 freq slivvers (12) - 3 freq haversack (12) - 1 freq slaivers (12) - 4 freq laverick (12) - 1 freq slappers (12) - 2 freq slavers' (12) - 1 freq slavers (12) - 12 freq laevrick (12) - 2 freq bladderwrack (12) - 2 freq slivers (12) - 5 freq |
SoundEx code - S411 shelipov - 1 freq self-abasement - 1 freq self-obsession - 1 freq self-publishin' - 1 freq salveific - 1 freq self-appyntment - 1 freq self-appointed - 1 freq self-appointit - 1 freq self-obsessed - 1 freq self-hypnosis - 1 freq sleepover - 1 freq sleepoversrock - 1 freq |
MetaPhone code - SLPFRSRK sleepoversrock - 1 freq |
SLEEPOVERSROCK |
| Time to execute Levenshtein function - 0.224664 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.387925 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.037170 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.037340 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.000864 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. |