| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairnin (0) - 185 freq lairnins (1) - 1 freq lairnan (1) - 3 freq bairnin (1) - 2 freq lairnin' (1) - 1 freq lairin (1) - 2 freq lairning (1) - 4 freq laernin (1) - 5 freq wairnin (1) - 7 freq lairnit (1) - 5 freq laitnin (1) - 1 freq airnin (1) - 1 freq larnin (1) - 27 freq hainin (2) - 20 freq wanrnin (2) - 1 freq cairnie (2) - 2 freq vairsin (2) - 1 freq larnin' (2) - 1 freq fairin (2) - 13 freq laitin (2) - 19 freq leernin (2) - 1 freq sainin (2) - 4 freq clairin (2) - 1 freq rairin (2) - 22 freq lairned (2) - 14 freq |
lairnin (0) - 185 freq laernin (1) - 5 freq larnin (1) - 27 freq lairnan (1) - 3 freq airnin (2) - 1 freq bairnin (2) - 2 freq lairnins (2) - 1 freq learnin (2) - 106 freq leernin (2) - 1 freq laitnin (2) - 1 freq lairnit (2) - 5 freq lairning (2) - 4 freq lairnin' (2) - 1 freq lairin (2) - 2 freq wairnin (2) - 7 freq tirnin (3) - 5 freq yarnin (3) - 18 freq lananin (3) - 1 freq girnin (3) - 74 freq liinnin (3) - 1 freq warnin (3) - 92 freq launin (3) - 1 freq lairn (3) - 134 freq birnin (3) - 2 freq earnin (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 |
LAIRNIN |
| Time to execute Levenshtein function - 0.682586 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.107126 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.094667 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.108427 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.000867 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. |