| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairned (0) - 14 freq wairned (1) - 2 freq lairner (1) - 5 freq airned (1) - 1 freq larned (1) - 12 freq lairne (1) - 2 freq laerned (1) - 9 freq laired (1) - 8 freq bairned (1) - 3 freq cairved (2) - 15 freq harned (2) - 3 freq yarned (2) - 2 freq haired (2) - 5 freq saired (2) - 7 freq paired (2) - 1 freq darned (2) - 2 freq faired (2) - 2 freq gairded (2) - 3 freq cairney (2) - 1 freq airted (2) - 31 freq cairted (2) - 5 freq laernd (2) - 1 freq mairied (2) - 10 freq lairie (2) - 2 freq warned (2) - 36 freq |
lairned (0) - 14 freq larned (1) - 12 freq laerned (1) - 9 freq lerned (2) - 1 freq laired (2) - 8 freq laernd (2) - 1 freq learned (2) - 78 freq bairned (2) - 3 freq lairne (2) - 2 freq lairner (2) - 5 freq airned (2) - 1 freq wairned (2) - 2 freq linned (3) - 2 freq lairnin (3) - 185 freq tirned (3) - 24 freq earned (3) - 17 freq laird (3) - 172 freq kirned (3) - 3 freq lairn (3) - 133 freq lairnt (3) - 54 freq girned (3) - 33 freq leired (3) - 1 freq alairmed (3) - 2 freq rained (3) - 13 freq learnd (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 |
LAIRNED |
| Time to execute Levenshtein function - 0.183088 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.358802 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.031461 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.036696 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.000842 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. |