| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowlevel (0) - 1 freq low-level (1) - 1 freq however (3) - 61 freq level (3) - 148 freq lowered (3) - 25 freq lowsened (3) - 2 freq lochleven (3) - 1 freq o-levels (3) - 2 freq lovel (3) - 1 freq lowlife (3) - 2 freq sqweel (4) - 2 freq swivel (4) - 5 freq fowlded (4) - 3 freq leeve (4) - 81 freq howlets (4) - 1 freq leeven (4) - 2 freq beleve (4) - 6 freq lovey (4) - 1 freq dowless (4) - 2 freq olives (4) - 17 freq lowse-up (4) - 1 freq forever (4) - 75 freq lowse (4) - 112 freq oo-wheel (4) - 1 freq folleyed (4) - 2 freq |
lowlevel (0) - 1 freq low-level (2) - 1 freq lowlife (5) - 2 freq llvl (5) - 1 freq lovel (5) - 1 freq level (5) - 148 freq lowlans (6) - 1 freq lawlier (6) - 1 freq laevil (6) - 1 freq lowly (6) - 5 freq sweevely (6) - 2 freq lawless (6) - 4 freq sowell (6) - 1 freq wolves (6) - 27 freq lowland (6) - 32 freq lovell (6) - 1 freq livvel (6) - 2 freq lovely (6) - 165 freq luvlee (6) - 2 freq swivel (6) - 5 freq lochleven (6) - 1 freq o-levels (6) - 2 freq lowsened (6) - 2 freq lowered (6) - 25 freq sea-level (6) - 1 freq |
SoundEx code - L414 lilly-flouer - 1 freq low-level - 1 freq lowlevel - 1 freq |
MetaPhone code - LLFL low-level - 1 freq lowlevel - 1 freq |
LOWLEVEL |
| Time to execute Levenshtein function - 0.711875 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 - 1.012226 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.090738 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.101043 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.000901 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. |