| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larned (0) - 12 freq darned (1) - 2 freq warned (1) - 36 freq lairned (1) - 14 freq larne (1) - 19 freq harned (1) - 3 freq lerned (1) - 1 freq earned (1) - 19 freq learned (1) - 79 freq yarned (1) - 2 freq laerned (1) - 9 freq gaaned (2) - 1 freq corned (2) - 8 freq tarred (2) - 4 freq garbed (2) - 3 freq ained (2) - 19 freq lorne (2) - 6 freq kirned (2) - 3 freq jared (2) - 3 freq yarked (2) - 9 freq laund (2) - 89 freq pained (2) - 1 freq warked (2) - 23 freq harmed (2) - 1 freq arne (2) - 1 freq |
larned (0) - 12 freq laerned (1) - 9 freq lerned (1) - 1 freq learned (1) - 79 freq lairned (1) - 14 freq larne (2) - 19 freq darned (2) - 2 freq yarned (2) - 2 freq laernd (2) - 1 freq warned (2) - 36 freq harned (2) - 3 freq learnd (2) - 1 freq earned (2) - 19 freq airned (3) - 1 freq lurked (3) - 4 freq tirned (3) - 24 freq leared (3) - 1 freq limned (3) - 1 freq wairned (3) - 2 freq larnin (3) - 27 freq purned (3) - 1 freq lard (3) - 4 freq derned (3) - 5 freq borned (3) - 1 freq lured (3) - 2 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 |
LARNED |
| Time to execute Levenshtein function - 0.202404 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.360258 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.027424 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.037261 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.000882 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. |