| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enrolling (0) - 1 freq strolling (2) - 6 freq trolling (2) - 3 freq enfolding (2) - 1 freq rolling (2) - 7 freq endling (3) - 1 freq trollin (3) - 1 freq thrilling (3) - 1 freq rollin (3) - 58 freq grilling (3) - 1 freq patrolling (3) - 1 freq enrolled (3) - 2 freq drooling (3) - 2 freq growling (3) - 1 freq scrollin (3) - 6 freq polling (3) - 3 freq unwilling (3) - 1 freq unfolding (3) - 2 freq rollin' (3) - 1 freq strollin (3) - 3 freq eurolang (3) - 9 freq excelling (3) - 1 freq erling (3) - 1 freq birlling (3) - 1 freq rowling (3) - 3 freq |
enrolling (0) - 1 freq trolling (3) - 3 freq rolling (3) - 7 freq birlling (4) - 1 freq unwilling (4) - 1 freq strolling (4) - 6 freq grilling (4) - 1 freq enfolding (4) - 1 freq rollin' (5) - 1 freq eurolang (5) - 9 freq unfolding (5) - 2 freq rowling (5) - 3 freq involving (5) - 4 freq erling (5) - 1 freq excelling (5) - 1 freq controlling (5) - 3 freq rollin (5) - 58 freq thrilling (5) - 1 freq trollin (5) - 1 freq polling (5) - 3 freq patrolling (5) - 1 freq endling (5) - 1 freq growling (5) - 1 freq enrolled (5) - 2 freq drooling (5) - 2 freq |
SoundEx code - E564 emerald - 17 freq enrolled - 2 freq emeralds - 10 freq enrol - 1 freq enrolling - 1 freq |
MetaPhone code - ENRLNK enrolling - 1 freq |
ENROLLING |
| Time to execute Levenshtein function - 0.248856 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.412106 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.030558 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.045203 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.001007 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. |