Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
sleepwalk (0) - 1 freq sleepwalkers (3) - 1 freq sleepan (3) - 23 freq sleep-walkin (3) - 3 freq lee-wark (3) - 1 freq sleepless (4) - 7 freq sleepin-i (4) - 1 freq sleepin (4) - 160 freq sleep's (4) - 1 freq speeshal (4) - 1 freq sleekitly (4) - 4 freq pleepan (4) - 1 freq sleeping (4) - 15 freq leetral (4) - 1 freq steeplt (4) - 1 freq sleep (4) - 406 freq slipway (4) - 2 freq bleepan (4) - 1 freq seegnals (4) - 11 freq seevral (4) - 1 freq sleepin' (4) - 1 freq sleeper (4) - 2 freq sleep' (4) - 6 freq sleeplin (4) - 1 freq speecial (4) - 26 freq |
sleepwalk (0) - 1 freq sleep-walkin (5) - 3 freq sleepwalkers (5) - 1 freq sleeplin (6) - 1 freq slipway (6) - 2 freq slawlik (6) - 2 freq lee-wark (6) - 1 freq sleepan (6) - 23 freq sleeping' (7) - 1 freq eeswal (7) - 10 freq sleely (7) - 1 freq sleeps (7) - 47 freq sleept (7) - 1 freq sleep-walking (7) - 1 freq sleepy (7) - 35 freq sleepover (7) - 1 freq sleepit (7) - 40 freq sleepers (7) - 4 freq slowlike (7) - 1 freq slowly (7) - 229 freq slawly (7) - 49 freq sleepeen (7) - 1 freq sieepily (7) - 1 freq sleepet (7) - 1 freq sleep-talkin (7) - 1 freq |
SoundEx code - S414 sleeplin - 1 freq self-labellin - 1 freq sleepless - 7 freq syllable - 12 freq self-help - 3 freq self-flagellatin - 1 freq self-belief - 3 freq skilful - 4 freq self-learnt - 1 freq skillfully - 1 freq selfless - 3 freq syllables - 8 freq syllable's - 1 freq selflessness - 1 freq skilfully - 1 freq sellafield - 1 freq sea-level - 1 freq self-loathers - 1 freq scalpels - 1 freq sleep-walkin - 3 freq sleep-walking - 1 freq sleepwalk - 1 freq sleeveless - 1 freq selflessly - 1 freq sallyblackledg - 5 freq sleepwalkers - 1 freq sluvvly - 1 freq self-fulfilling - 1 freq schoolofppls - 1 freq |
MetaPhone code - SLPWLK sleepwalk - 1 freq |
SLEEPWALK |
Time to execute Levenshtein function - 0.289331 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.441224 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.032070 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.036939 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.000830 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. |