| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairnin (0) - 185 freq lairin (1) - 2 freq lairnan (1) - 3 freq lairnit (1) - 5 freq lairning (1) - 3 freq lairnins (1) - 1 freq wairnin (1) - 7 freq larnin (1) - 27 freq laernin (1) - 5 freq airnin (1) - 1 freq bairnin (1) - 2 freq laitnin (1) - 1 freq lairnin' (1) - 1 freq lairit (2) - 1 freq airin (2) - 4 freq bairgin (2) - 1 freq yairnit (2) - 3 freq kirnin (2) - 5 freq leernin (2) - 1 freq bairnis (2) - 6 freq unlairnin (2) - 1 freq lairned (2) - 14 freq lairdie (2) - 3 freq waarnin (2) - 4 freq mairtin (2) - 1 freq |
lairnin (0) - 185 freq larnin (1) - 27 freq lairnan (1) - 3 freq laernin (1) - 5 freq bairnin (2) - 2 freq learnin (2) - 106 freq leernin (2) - 1 freq airnin (2) - 1 freq lairnin' (2) - 1 freq laitnin (2) - 1 freq wairnin (2) - 7 freq lairin (2) - 2 freq lairning (2) - 3 freq lairnit (2) - 5 freq lairnins (2) - 1 freq larnin' (3) - 1 freq darnin (3) - 2 freq launin (3) - 1 freq lairns (3) - 7 freq lairn (3) - 133 freq leirin (3) - 1 freq linnin (3) - 2 freq lairnt (3) - 54 freq linin (3) - 10 freq warnin (3) - 92 freq |
SoundEx code - L655 learnin - 106 freq lairnin - 185 freq lairnins - 1 freq learnen - 1 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 lairning - 3 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.223180 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.357545 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.027707 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.036732 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.000812 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. |