| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| learnit (0) - 12 freq learnin (1) - 106 freq learn't (1) - 9 freq learntit (1) - 1 freq lernit (1) - 1 freq learit (1) - 3 freq learnt (1) - 153 freq learin (2) - 8 freq hearit (2) - 2 freq fearit (2) - 3 freq larnin (2) - 27 freq beardit (2) - 2 freq wearit (2) - 7 freq learnen (2) - 1 freq leant (2) - 34 freq lernt (2) - 4 freq dernit (2) - 4 freq leanin (2) - 49 freq learned (2) - 78 freq leirit (2) - 24 freq learnin' (2) - 2 freq earnin (2) - 7 freq lardit (2) - 1 freq learner (2) - 7 freq leart (2) - 4 freq |
learnit (0) - 12 freq lernit (1) - 1 freq learnt (1) - 153 freq lernt (2) - 4 freq leernt (2) - 2 freq lairnit (2) - 5 freq larnt (2) - 13 freq learntit (2) - 1 freq learit (2) - 3 freq learn't (2) - 9 freq learnin (2) - 106 freq learns (3) - 10 freq earnt (3) - 10 freq lannit (3) - 3 freq learn (3) - 287 freq lerrit (3) - 2 freq learnan (3) - 2 freq lairnt (3) - 54 freq leernin (3) - 1 freq leart (3) - 4 freq hoarnit (3) - 1 freq learnd (3) - 1 freq lerint (3) - 1 freq learner (3) - 7 freq laarant (3) - 1 freq |
SoundEx code - L653 learn't - 9 freq learnt - 153 freq lairnt - 54 freq learned - 78 freq lairned - 14 freq lairnit - 5 freq 'learned' - 1 freq laarant - 1 freq larnt - 13 freq laerned - 9 freq larned - 12 freq learnd - 1 freq learnit - 12 freq lernt - 4 freq lernit - 1 freq leernt - 2 freq lairn't - 1 freq learnèd - 1 freq learntit - 1 freq laernd - 1 freq lerint - 1 freq lerned - 1 freq |
MetaPhone code - LRNT learn't - 9 freq learnt - 153 freq lairnt - 54 freq learned - 78 freq lairned - 14 freq lairnit - 5 freq 'learned' - 1 freq laarant - 1 freq larnt - 13 freq laerned - 9 freq larned - 12 freq learnd - 1 freq learnit - 12 freq lernt - 4 freq lernit - 1 freq leernt - 2 freq lairn't - 1 freq learnèd - 1 freq laernd - 1 freq lerint - 1 freq lerned - 1 freq |
LEARNIT |
| Time to execute Levenshtein function - 0.205190 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.365623 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.035986 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.050100 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.000831 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. |