| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lerint (0) - 1 freq lernt (1) - 4 freq behint (2) - 5 freq learnt (2) - 157 freq lerick (2) - 1 freq lerrit (2) - 2 freq sprint (2) - 8 freq leist (2) - 3 freq merit (2) - 17 freq repint (2) - 3 freq dernt (2) - 1 freq lern (2) - 3 freq lint (2) - 17 freq learin (2) - 8 freq eerant (2) - 2 freq lerne (2) - 1 freq termint (2) - 2 freq peint (2) - 5 freq leaing (2) - 1 freq lehin (2) - 4 freq learit (2) - 3 freq leift (2) - 1 freq ledit (2) - 1 freq levit (2) - 2 freq eerins (2) - 6 freq |
lerint (0) - 1 freq lernt (1) - 4 freq lernit (2) - 1 freq larnt (2) - 13 freq leernt (2) - 2 freq learnt (2) - 157 freq rint (3) - 4 freq lorina (3) - 3 freq leerin (3) - 5 freq lerone (3) - 1 freq leant (3) - 34 freq laarant (3) - 1 freq leirit (3) - 24 freq lent (3) - 38 freq frint (3) - 1 freq lenient (3) - 2 freq leirin (3) - 1 freq werent (3) - 1 freq lairnt (3) - 54 freq print (3) - 24 freq luring (3) - 1 freq leent (3) - 26 freq learin (3) - 8 freq eerant (3) - 2 freq lern (3) - 3 freq |
SoundEx code - L653 learn't - 9 freq learnt - 157 freq lairnt - 54 freq learned - 79 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 - 157 freq lairnt - 54 freq learned - 79 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 |
LERINT |
| Time to execute Levenshtein function - 0.310230 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.470916 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.032110 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.062558 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.000839 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. |