| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larned (0) - 12 freq lerned (1) - 1 freq yarned (1) - 2 freq learned (1) - 78 freq warned (1) - 36 freq darned (1) - 2 freq larne (1) - 19 freq earned (1) - 17 freq lairned (1) - 14 freq harned (1) - 3 freq laerned (1) - 9 freq warked (2) - 23 freq farted (2) - 3 freq hained (2) - 27 freq varied (2) - 8 freq fared (2) - 11 freq horned (2) - 2 freq kirned (2) - 3 freq wared (2) - 9 freq sarne (2) - 1 freq lamped (2) - 2 freq arsed (2) - 18 freq lasted (2) - 15 freq carred (2) - 1 freq carved (2) - 21 freq |
larned (0) - 12 freq laerned (1) - 9 freq lairned (1) - 14 freq learned (1) - 78 freq lerned (1) - 1 freq laernd (2) - 1 freq learnd (2) - 1 freq harned (2) - 3 freq earned (2) - 17 freq warned (2) - 36 freq darned (2) - 2 freq yarned (2) - 2 freq larne (2) - 19 freq derned (3) - 5 freq laund (3) - 89 freq bairned (3) - 3 freq larnt (3) - 13 freq girned (3) - 33 freq lard (3) - 4 freq purned (3) - 1 freq turned (3) - 491 freq leared (3) - 1 freq larn (3) - 16 freq lorne (3) - 6 freq laand (3) - 69 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 |
LARNED |
| Time to execute Levenshtein function - 0.211723 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.350504 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.028053 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.037911 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.000830 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. |