| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larnin (0) - 27 freq lannin (1) - 2 freq learnin (1) - 106 freq darnin (1) - 2 freq larnin' (1) - 1 freq lairnin (1) - 185 freq launin (1) - 1 freq laernin (1) - 5 freq larkin (1) - 3 freq earnin (1) - 7 freq yarnin (1) - 18 freq warnin (1) - 92 freq warnan (2) - 1 freq lashin (2) - 8 freq lananin (2) - 1 freq laenan (2) - 1 freq hannin (2) - 3 freq aanin (2) - 2 freq bannin (2) - 5 freq arhin (2) - 1 freq lurkin (2) - 13 freq lairin (2) - 2 freq lakin (2) - 1 freq ainin (2) - 1 freq lackin (2) - 14 freq |
larnin (0) - 27 freq laernin (1) - 5 freq learnin (1) - 106 freq lairnin (1) - 185 freq learnan (2) - 2 freq leernin (2) - 1 freq learnen (2) - 1 freq lairnan (2) - 3 freq warnin (2) - 92 freq yarnin (2) - 18 freq darnin (2) - 2 freq larnin' (2) - 1 freq lannin (2) - 2 freq larkin (2) - 3 freq launin (2) - 1 freq earnin (2) - 7 freq lownin (3) - 2 freq curnin (3) - 1 freq alarmin (3) - 4 freq learnit (3) - 12 freq murnin (3) - 14 freq tirnin (3) - 5 freq laren (3) - 21 freq wearnin (3) - 1 freq lairnin' (3) - 1 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 |
LARNIN |
| Time to execute Levenshtein function - 0.402350 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.710687 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.080555 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.036671 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. |