| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asleep (0) - 156 freq asleip (1) - 2 freq asleap (1) - 1 freq asteep (1) - 2 freq sleep (1) - 406 freq sheep (2) - 295 freq €˜sleep (2) - 2 freq apkeep (2) - 5 freq aglee (2) - 1 freq pleep (2) - 3 freq sleeps (2) - 47 freq sleip (2) - 4 freq leep (2) - 2 freq sweep (2) - 31 freq sliep (2) - 1 freq slep (2) - 10 freq sleek (2) - 13 freq bleep (2) - 2 freq asweel (2) - 18 freq fleep (2) - 1 freq steep (2) - 34 freq sleep' (2) - 6 freq naesleep (2) - 1 freq 'sleep' (2) - 1 freq aileen (2) - 7 freq |
asleep (0) - 156 freq asleap (1) - 1 freq sleep (1) - 406 freq asleip (1) - 2 freq slep (2) - 10 freq sleip (2) - 4 freq sliep (2) - 1 freq sleepy (2) - 35 freq asteep (2) - 2 freq naesleep (3) - 1 freq sleep' (3) - 6 freq slee (3) - 24 freq slop (3) - 2 freq seep (3) - 5 freq sloop (3) - 3 freq slepe (3) - 3 freq slap (3) - 55 freq steep (3) - 34 freq asleid (3) - 1 freq sleet (3) - 46 freq sleept (3) - 1 freq sheep (3) - 295 freq slip (3) - 66 freq leep (3) - 2 freq sleeps (3) - 47 freq |
SoundEx code - A241 asleep - 156 freq auchleven - 1 freq asleap - 1 freq asleip - 2 freq ashleyfrankly - 1 freq |
MetaPhone code - ASLP asleep - 156 freq asleap - 1 freq asleip - 2 freq |
ASLEEP sleep - 406 freq sleepin - 160 freq asleep - 156 freq sleeps - 47 freq sleepit - 39 freq sleepy - 35 freq sleepan - 23 freq sleeping - 15 freq sleep' - 6 freq sleepers - 4 freq sleeper - 2 freq sleepless - 7 freq sleep-walkin - 3 freq |
| Time to execute Levenshtein function - 0.333031 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.585069 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.033085 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.083134 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.001333 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. |