| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| learnin (0) - 106 freq yearnin (1) - 1 freq learnins (1) - 1 freq leernin (1) - 1 freq learnan (1) - 2 freq learnen (1) - 1 freq learnin' (1) - 2 freq learnit (1) - 12 freq learning (1) - 33 freq learin (1) - 8 freq earnin (1) - 8 freq larnin (1) - 27 freq leanin (1) - 49 freq wearnin (1) - 1 freq waarnin (2) - 4 freq nearin (2) - 6 freq learner (2) - 8 freq leafin (2) - 3 freq earnins (2) - 4 freq bearin (2) - 28 freq larnin' (2) - 1 freq leerin (2) - 5 freq wearyin (2) - 9 freq leanan (2) - 4 freq launin (2) - 1 freq |
learnin (0) - 106 freq larnin (1) - 27 freq learnen (1) - 1 freq learnan (1) - 2 freq leernin (1) - 1 freq laernin (2) - 5 freq leanin (2) - 49 freq wearnin (2) - 1 freq earnin (2) - 8 freq lairnin (2) - 185 freq yearnin (2) - 1 freq learin (2) - 8 freq learnin' (2) - 2 freq learnins (2) - 1 freq learnit (2) - 12 freq learning (2) - 33 freq learns (3) - 10 freq darnin (3) - 2 freq lenin (3) - 1 freq warnin (3) - 92 freq learnd (3) - 1 freq loanin (3) - 11 freq lennin (3) - 2 freq learn (3) - 294 freq leenin (3) - 8 freq |
SoundEx code - L655 learnin - 106 freq lairnin - 185 freq lairnins - 1 freq learnen - 1 freq lairning - 4 freq larnin - 27 freq larnin' - 1 freq learning - 33 freq laernin - 5 freq lairnan - 3 freq learnin' - 2 freq learnan - 2 freq lairnin' - 1 freq leernin - 1 freq €œlearnin - 1 freq learnins - 1 freq learnincurve - 1 freq learningcityds - 2 freq |
MetaPhone code - LRNN learnin - 106 freq lairnin - 185 freq learnen - 1 freq larnin - 27 freq larnin' - 1 freq laernin - 5 freq lairnan - 3 freq learnin' - 2 freq learnan - 2 freq lairnin' - 1 freq leernin - 1 freq €œlearnin - 1 freq |
LEARNIN |
| Time to execute Levenshtein function - 0.302438 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.567173 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.028300 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.070860 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.000940 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. |