| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| learned (0) - 78 freq learnen (1) - 1 freq earned (1) - 17 freq leaned (1) - 40 freq leared (1) - 1 freq larned (1) - 12 freq lerned (1) - 1 freq learnd (1) - 1 freq learner (1) - 7 freq leamed (2) - 4 freq darned (2) - 2 freq learners (2) - 6 freq unlearned (2) - 1 freq leanne (2) - 31 freq 'learned' (2) - 1 freq lerne (2) - 1 freq lairned (2) - 14 freq derned (2) - 5 freq waarned (2) - 2 freq weared (2) - 1 freq leired (2) - 1 freq learn't (2) - 9 freq learnt (2) - 153 freq harned (2) - 3 freq larne (2) - 19 freq |
learned (0) - 78 freq lerned (1) - 1 freq larned (1) - 12 freq learnd (1) - 1 freq leared (2) - 1 freq laerned (2) - 9 freq learner (2) - 7 freq learnen (2) - 1 freq leaned (2) - 40 freq earned (2) - 17 freq lairned (2) - 14 freq learnin (3) - 106 freq yarned (3) - 2 freq herned (3) - 1 freq larne (3) - 19 freq leered (3) - 1 freq laernd (3) - 1 freq harned (3) - 3 freq learnan (3) - 2 freq learnit (3) - 12 freq learn (3) - 287 freq learns (3) - 10 freq warned (3) - 36 freq waarned (3) - 2 freq lerne (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 |
LEARNED |
| Time to execute Levenshtein function - 0.196074 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.381627 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.027381 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.037436 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.000836 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. |