| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rulers (0) - 8 freq ruler (1) - 10 freq rules (1) - 180 freq ruders (1) - 1 freq rupes (2) - 1 freq jules (2) - 1 freq luvers (2) - 12 freq fules (2) - 2 freq cumers (2) - 1 freq aumers (2) - 4 freq rivers (2) - 30 freq splers (2) - 1 freq rypers (2) - 1 freq allers (2) - 1 freq roles (2) - 12 freq eilers (2) - 1 freq jylers (2) - 3 freq rueless (2) - 1 freq reuters (2) - 6 freq rowlers (2) - 3 freq curers (2) - 1 freq ruled (2) - 25 freq idlers (2) - 1 freq ruggers (2) - 1 freq bulders (2) - 1 freq |
rulers (0) - 8 freq rules (2) - 180 freq ruders (2) - 1 freq ruler (2) - 10 freq culurs (3) - 2 freq racers (3) - 1 freq rakers (3) - 1 freq bilers (3) - 1 freq tylers (3) - 1 freq saulers (3) - 1 freq ryders (3) - 1 freq rimers (3) - 1 freq rollers (3) - 6 freq rowers (3) - 3 freq riders (3) - 8 freq rogers (3) - 6 freq ruifers (3) - 1 freq refers (3) - 27 freq curlers (3) - 6 freq rovers (3) - 23 freq idlers (3) - 1 freq bylers (3) - 2 freq balers (3) - 1 freq jylers (3) - 3 freq rueless (3) - 1 freq |
SoundEx code - R462 rulers - 8 freq rollers - 6 freq rowlers - 3 freq railworks - 1 freq rollercoaster - 7 freq rowlerskate - 1 freq reeler's - 1 freq rulership - 1 freq rollerskates - 1 freq rrlrahiz - 3 freq rollerskatechamp - 1 freq |
MetaPhone code - RLRS rulers - 8 freq rollers - 6 freq rowlers - 3 freq reeler's - 1 freq |
RULERS |
| Time to execute Levenshtein function - 0.193683 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.345003 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.029429 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.044269 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.001063 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. |