Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
sleepover (0) - 1 freq sleep-ower (2) - 1 freq sleeper (2) - 2 freq fleepaper (3) - 1 freq stopover (3) - 1 freq sleeved (3) - 3 freq leftover (3) - 1 freq sweeper (3) - 3 freq sleeves (3) - 27 freq sleepeen (3) - 1 freq sleeve (3) - 46 freq steeper (3) - 1 freq sleepers (3) - 4 freq sleepet (3) - 1 freq neeper (4) - 5 freq leftovers (4) - 3 freq fleeter (4) - 1 freq slepe (4) - 3 freq pleepses (4) - 1 freq pleeped (4) - 2 freq skreiver (4) - 3 freq cleesher (4) - 1 freq slapper (4) - 5 freq cleaver (4) - 4 freq shampooer (4) - 1 freq |
sleepover (0) - 1 freq sleeper (3) - 2 freq stopover (4) - 1 freq sleep-ower (4) - 1 freq slaver (5) - 6 freq sleepet (5) - 1 freq spaver (5) - 3 freq slipper (5) - 4 freq slapper (5) - 5 freq sleepers (5) - 4 freq sliver (5) - 8 freq steeper (5) - 1 freq fleepaper (5) - 1 freq sleeved (5) - 3 freq sweeper (5) - 3 freq sleeves (5) - 27 freq sleepeen (5) - 1 freq slaiver (5) - 1 freq sleeve (5) - 46 freq skreever (6) - 4 freq sleepan (6) - 23 freq sleeping (6) - 15 freq sleeplin (6) - 1 freq sleeps (6) - 47 freq lever (6) - 2 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 - SLPFR sleepover - 1 freq |
SLEEPOVER |
Time to execute Levenshtein function - 0.319250 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.448261 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.027900 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.037372 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.000855 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. |