| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pre-rollers (0) - 1 freq pre-rolled (2) - 2 freq pre-orders (3) - 1 freq pre-order (4) - 2 freq high-rollers (4) - 1 freq strollers (4) - 2 freq revellers (4) - 1 freq preesoners (4) - 4 freq csstrollers (4) - 3 freq pre-modern (4) - 1 freq rollers (4) - 6 freq preisoners (4) - 1 freq pre-vers (4) - 1 freq trevellers (4) - 8 freq controllers (4) - 1 freq reformers (5) - 7 freq peerless (5) - 1 freq pot-holes (5) - 1 freq primroses (5) - 3 freq pellets (5) - 5 freq pre-oil (5) - 1 freq pop-holes (5) - 2 freq beholders (5) - 2 freq retailers (5) - 3 freq treveller (5) - 1 freq |
pre-rollers (0) - 1 freq pre-rolled (4) - 2 freq pre-orders (5) - 1 freq trevellers (7) - 8 freq controllers (7) - 1 freq rollers (7) - 6 freq pre-vers (7) - 1 freq revellers (7) - 1 freq strollers (7) - 2 freq pre-order (7) - 2 freq high-rollers (7) - 1 freq travellers (8) - 6 freq traivellers (8) - 16 freq parallels (8) - 6 freq thrillers (8) - 1 freq performers (8) - 6 freq pre-stellar (8) - 1 freq painkillers (8) - 3 freq pre-modern (8) - 1 freq csstrollers (8) - 3 freq preisoners (8) - 1 freq pillers (8) - 2 freq propeller (8) - 1 freq preesoners (8) - 4 freq pre-norse (8) - 1 freq |
SoundEx code - P664 pre-rolled - 2 freq pre-rollers - 1 freq |
MetaPhone code - PRRLRS pre-rollers - 1 freq |
PRE-ROLLERS |
| Time to execute Levenshtein function - 0.196260 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.379235 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.035937 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.037446 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.000906 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. |