Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
enrolled (0) - 2 freq unrolled (1) - 7 freq envolved (2) - 1 freq extolled (2) - 1 freq trolled (2) - 1 freq strolled (2) - 5 freq carolled (2) - 1 freq €œrolled (2) - 1 freq scrolled (2) - 2 freq rolled (2) - 55 freq enjosed (3) - 5 freq ealled (3) - 1 freq engorged (3) - 1 freq pre-rolled (3) - 2 freq enforced (3) - 3 freq eroded (3) - 2 freq unrowed (3) - 2 freq dolled (3) - 6 freq enabled (3) - 1 freq roller (3) - 27 freq excelled (3) - 1 freq trolley (3) - 27 freq paroled (3) - 1 freq enriched (3) - 3 freq enjoyed (3) - 135 freq |
enrolled (0) - 2 freq unrolled (1) - 7 freq trolled (3) - 1 freq carolled (3) - 1 freq rolled (3) - 55 freq trilled (4) - 1 freq grilled (4) - 2 freq roulled (4) - 1 freq drilled (4) - 1 freq marlled (4) - 1 freq uncalled (4) - 2 freq unfollaed (4) - 1 freq oonrowled (4) - 1 freq strolled (4) - 5 freq envolved (4) - 1 freq extolled (4) - 1 freq scrolled (4) - 2 freq €œrolled (4) - 1 freq unroofed (5) - 1 freq crowled (5) - 2 freq involved (5) - 140 freq snorled (5) - 2 freq tolled (5) - 1 freq unbolted (5) - 1 freq enrol (5) - 1 freq |
SoundEx code - E564 emerald - 17 freq enrolled - 2 freq emeralds - 10 freq enrol - 1 freq enrolling - 1 freq |
MetaPhone code - ENRLT enrolled - 2 freq |
ENROLLED |
Time to execute Levenshtein function - 0.225015 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.484946 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.039324 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.039120 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.000926 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. |