| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pre-rolled (0) - 2 freq pre-rollers (2) - 1 freq pre-cooked (3) - 1 freq enrolled (3) - 2 freq extolled (4) - 1 freq resolved (4) - 8 freq rolled (4) - 55 freq ragdolled (4) - 1 freq reffelled (4) - 1 freq repeopled (4) - 1 freq recalled (4) - 1 freq reeselled (4) - 1 freq scrolled (4) - 2 freq pre-order (4) - 2 freq pre-covid (4) - 1 freq trevelled (4) - 6 freq pre-opened (4) - 1 freq strolled (4) - 5 freq €œrolled (4) - 1 freq unrolled (4) - 7 freq revolved (4) - 1 freq paroled (4) - 1 freq trolled (4) - 1 freq grey-cowled (4) - 1 freq fire-filled (4) - 1 freq |
pre-rolled (0) - 2 freq pre-rollers (4) - 1 freq enrolled (6) - 2 freq fire-filled (6) - 1 freq pre-cooked (6) - 1 freq pedalled (7) - 1 freq carolled (7) - 1 freq re-told (7) - 1 freq pre-oil (7) - 1 freq petalled (7) - 1 freq pre-med (7) - 1 freq controlled (7) - 14 freq grey-cowled (7) - 1 freq quarrelled (7) - 2 freq pot-bellied (7) - 3 freq pre-ordained (7) - 1 freq corralled (7) - 2 freq barrelled (7) - 3 freq prodrill (7) - 3 freq rebelled (7) - 1 freq trolled (7) - 1 freq sae-called (7) - 2 freq prevailed (7) - 6 freq recalled (7) - 1 freq reeselled (7) - 1 freq |
SoundEx code - P664 pre-rolled - 2 freq pre-rollers - 1 freq |
MetaPhone code - PRRLT pre-rolled - 2 freq |
PRE-ROLLED |
| Time to execute Levenshtein function - 0.227970 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.398372 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.027346 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.043579 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.000952 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. |