| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairnt (0) - 54 freq airnt (1) - 1 freq larnt (1) - 13 freq lairn't (1) - 1 freq lairns (1) - 7 freq lairn (1) - 133 freq lairit (1) - 1 freq mairnt (1) - 1 freq cairnt (1) - 1 freq lairt (1) - 5 freq lairne (1) - 2 freq bairnt (1) - 5 freq lairnit (1) - 5 freq kaint (2) - 4 freq dairt (2) - 6 freq hairnet (2) - 2 freq gaint (2) - 1 freq lairnin (2) - 185 freq lairin (2) - 2 freq aint (2) - 13 freq taint (2) - 2 freq lamont (2) - 8 freq lairner (2) - 5 freq kairn (2) - 1 freq nairne (2) - 2 freq |
lairnt (0) - 54 freq lairnit (1) - 5 freq larnt (1) - 13 freq lernt (2) - 4 freq lairne (2) - 2 freq lairt (2) - 5 freq laarant (2) - 1 freq learnt (2) - 153 freq leernt (2) - 2 freq bairnt (2) - 5 freq cairnt (2) - 1 freq lairn't (2) - 1 freq airnt (2) - 1 freq lairn (2) - 133 freq lairns (2) - 7 freq lairit (2) - 1 freq mairnt (2) - 1 freq lairnan (3) - 3 freq daurnt (3) - 1 freq leirit (3) - 24 freq lament (3) - 21 freq birnt (3) - 1 freq earnt (3) - 10 freq yairnit (3) - 3 freq larne (3) - 19 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 |
LAIRNT |
| Time to execute Levenshtein function - 0.375639 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.623006 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.038808 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.037899 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.001068 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. |