| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| level-crossin (0) - 1 freq weel-chosen (5) - 1 freq weel-dressit (5) - 1 freq weel-wussin (5) - 1 freq weel-dressed (6) - 2 freq reversin (6) - 4 freq ever-lastin (6) - 1 freq levellin (6) - 5 freq leverin (6) - 2 freq hime-croonin (6) - 1 freq croescrossing (6) - 2 freq iver-risin (6) - 1 freq weel-pressed (6) - 2 freq ever-changin (6) - 1 freq crossin (6) - 30 freq developin (6) - 36 freq weel-grundit (7) - 1 freq everlestin (7) - 1 freq weel-seen (7) - 2 freq severin (7) - 1 freq revellers (7) - 1 freq bevellers (7) - 1 freq crossit (7) - 7 freq lave-in (7) - 1 freq weel-forrit (7) - 6 freq |
level-crossin (0) - 1 freq weel-wussin (9) - 1 freq weel-dressit (9) - 1 freq weel-chosen (9) - 1 freq crossin (10) - 30 freq iver-risin (10) - 1 freq weel-pressed (10) - 2 freq double-cross (10) - 1 freq weel-dressed (10) - 2 freq a-dressin (11) - 2 freq accressin (11) - 1 freq imccrossan (11) - 2 freq weel-creeshed (11) - 1 freq croassin (11) - 2 freq luveless (11) - 1 freq loveless (11) - 1 freq doublecross (11) - 2 freq sel-consumin (11) - 1 freq tollcross (11) - 5 freq applecross (11) - 2 freq luve-arras (11) - 1 freq life-cless (11) - 1 freq iversson (11) - 1 freq deevil-lassie (11) - 1 freq belarussian (11) - 1 freq |
SoundEx code - L142 labels - 6 freq leafless - 4 freq love-light - 1 freq levels - 66 freq luveless - 1 freq loveliest - 6 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq lapels - 1 freq level-crossin - 1 freq levels' - 1 freq lifelessness - 1 freq lyfie-lik - 1 freq leevils - 1 freq leevels - 1 freq leaf-lik - 1 freq levils - 1 freq liwuplxrqr - 1 freq levels - 1 freq leavealightonforscotland - 1 freq loopholes - 1 freq |
MetaPhone code - LFLKRSN level-crossin - 1 freq |
LEVEL-CROSSIN |
| Time to execute Levenshtein function - 0.225864 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.480005 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.034267 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.041661 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.000899 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. |