| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larnin (0) - 27 freq launin (1) - 1 freq yarnin (1) - 18 freq earnin (1) - 8 freq laernin (1) - 5 freq larnin' (1) - 1 freq darnin (1) - 2 freq lannin (1) - 2 freq learnin (1) - 106 freq warnin (1) - 92 freq larkin (1) - 3 freq lairnin (1) - 185 freq markin (2) - 17 freq rnin (2) - 1 freq wearnin (2) - 1 freq laivin (2) - 2 freq lapin (2) - 1 freq lynin (2) - 1 freq lammin (2) - 2 freq harkin (2) - 5 freq lakin (2) - 1 freq burnin (2) - 131 freq wanin (2) - 2 freq turnin (2) - 321 freq hainin (2) - 20 freq |
larnin (0) - 27 freq learnin (1) - 106 freq laernin (1) - 5 freq lairnin (1) - 185 freq learnen (2) - 1 freq learnan (2) - 2 freq earnin (2) - 8 freq launin (2) - 1 freq leernin (2) - 1 freq lairnan (2) - 3 freq larkin (2) - 3 freq larnin' (2) - 1 freq warnin (2) - 92 freq darnin (2) - 2 freq lannin (2) - 2 freq yarnin (2) - 18 freq alarmin (3) - 4 freq daurnin (3) - 1 freq lann (3) - 1 freq lurkin (3) - 13 freq larn (3) - 16 freq lairning (3) - 4 freq laren (3) - 21 freq lananin (3) - 1 freq lairnit (3) - 5 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 |
LARNIN |
| Time to execute Levenshtein function - 0.223815 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.343317 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.030967 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.038901 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.000882 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. |