| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asleep (0) - 146 freq asleip (1) - 2 freq asteep (1) - 2 freq sleep (1) - 395 freq asleap (1) - 1 freq sleek (2) - 13 freq fleep (2) - 1 freq aglee (2) - 1 freq sliep (2) - 1 freq sleet (2) - 46 freq sleept (2) - 1 freq sleep' (2) - 6 freq aileen (2) - 7 freq apkeep (2) - 5 freq sheep (2) - 295 freq seep (2) - 5 freq slee (2) - 24 freq 'sleep' (2) - 1 freq slep (2) - 10 freq asleid (2) - 1 freq aleen (2) - 97 freq aseef (2) - 1 freq sleeps (2) - 46 freq sleip (2) - 4 freq €˜sleep (2) - 2 freq |
asleep (0) - 146 freq asleap (1) - 1 freq sleep (1) - 395 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 slip (3) - 65 freq leep (3) - 2 freq sleek (3) - 13 freq sweep (3) - 31 freq sleeps (3) - 46 freq pleep (3) - 3 freq slap (3) - 53 freq slepe (3) - 3 freq steep (3) - 34 freq sloop (3) - 3 freq bleep (3) - 1 freq naesleep (3) - 1 freq seep (3) - 5 freq sheep (3) - 295 freq sleept (3) - 1 freq sleep' (3) - 6 freq |
SoundEx code - A241 asleep - 146 freq auchleven - 1 freq asleap - 1 freq asleip - 2 freq ashleyfrankly - 1 freq |
MetaPhone code - ASLP asleep - 146 freq asleap - 1 freq asleip - 2 freq |
ASLEEP |
| Time to execute Levenshtein function - 0.226958 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.369705 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.027352 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.037925 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.000834 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. |