| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larnt (0) - 13 freq larn (1) - 16 freq warnt (1) - 20 freq laant (1) - 1 freq darnt (1) - 1 freq lernt (1) - 4 freq lairnt (1) - 54 freq larne (1) - 19 freq lart (1) - 1 freq larns (1) - 1 freq earnt (1) - 10 freq learnt (1) - 153 freq earn (2) - 41 freq farns (2) - 2 freq saunt (2) - 14 freq lent (2) - 38 freq barbt (2) - 1 freq slant (2) - 3 freq gant (2) - 15 freq lern (2) - 3 freq flaret (2) - 2 freq carne (2) - 1 freq vaunt (2) - 1 freq leent (2) - 26 freq gaunt (2) - 8 freq |
larnt (0) - 13 freq lernt (1) - 4 freq lairnt (1) - 54 freq learnt (1) - 153 freq leernt (2) - 2 freq learnit (2) - 12 freq lairnit (2) - 5 freq lerint (2) - 1 freq laarant (2) - 1 freq lernit (2) - 1 freq earnt (2) - 10 freq laant (2) - 1 freq warnt (2) - 20 freq larn (2) - 16 freq larne (2) - 19 freq darnt (2) - 1 freq larns (2) - 1 freq lart (2) - 1 freq lurno (3) - 1 freq laran (3) - 2 freq burnt (3) - 88 freq lamont (3) - 8 freq alarmt (3) - 3 freq laernd (3) - 1 freq lament (3) - 21 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 |
LARNT |
| Time to execute Levenshtein function - 0.193481 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.342085 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.027909 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.036942 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.000808 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. |