| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| learnt (0) - 153 freq learnit (1) - 12 freq learit (1) - 3 freq leart (1) - 4 freq learn't (1) - 9 freq leernt (1) - 2 freq lernt (1) - 4 freq larnt (1) - 13 freq learnd (1) - 1 freq leant (1) - 34 freq earnt (1) - 10 freq learns (1) - 10 freq learn (1) - 287 freq laant (2) - 1 freq leans (2) - 16 freq meant (2) - 454 freq leirit (2) - 24 freq yearn (2) - 1 freq larns (2) - 1 freq lairnt (2) - 54 freq lean (2) - 47 freq earns (2) - 3 freq hearit (2) - 2 freq fear't (2) - 1 freq lears (2) - 2 freq |
learnt (0) - 153 freq larnt (1) - 13 freq learnit (1) - 12 freq lernt (1) - 4 freq leernt (1) - 2 freq lernit (2) - 1 freq lerint (2) - 1 freq laarant (2) - 1 freq lairnt (2) - 54 freq learns (2) - 10 freq learn (2) - 287 freq earnt (2) - 10 freq leart (2) - 4 freq learn't (2) - 9 freq learnd (2) - 1 freq learit (2) - 3 freq leant (2) - 34 freq learnan (3) - 2 freq learnen (3) - 1 freq larne (3) - 19 freq leent (3) - 26 freq lart (3) - 1 freq learin (3) - 8 freq dernt (3) - 1 freq leern (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 |
LEARNT |
| Time to execute Levenshtein function - 0.213134 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.352637 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.027998 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.037702 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.000834 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. |