| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairnit (0) - 5 freq lairnt (1) - 54 freq lairn't (1) - 1 freq lairit (1) - 2 freq yairnit (1) - 3 freq lairnin (1) - 185 freq lardit (2) - 1 freq lairner (2) - 5 freq fairdit (2) - 1 freq lairne (2) - 2 freq kirnit (2) - 1 freq laistit (2) - 2 freq airnt (2) - 1 freq cairnet (2) - 1 freq slairit (2) - 2 freq wairnin (2) - 7 freq pairlit (2) - 1 freq airnin (2) - 1 freq bairnis (2) - 6 freq larnin (2) - 27 freq lairt (2) - 5 freq cairtit (2) - 11 freq lairnins (2) - 1 freq hairnet (2) - 2 freq bairnie (2) - 70 freq |
lairnit (0) - 5 freq lairnt (1) - 54 freq larnt (2) - 13 freq learnit (2) - 12 freq lernit (2) - 1 freq lairnin (2) - 185 freq yairnit (2) - 3 freq lairn't (2) - 1 freq lairit (2) - 2 freq lairned (3) - 14 freq lirkit (3) - 7 freq lannit (3) - 3 freq lairnan (3) - 3 freq lairn (3) - 134 freq bairnt (3) - 5 freq laernin (3) - 5 freq cairnt (3) - 1 freq lernt (3) - 4 freq laarant (3) - 1 freq leernt (3) - 2 freq learnt (3) - 157 freq girnit (3) - 1 freq mairnt (3) - 1 freq laminit (3) - 1 freq lairns (3) - 7 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 |
LAIRNIT |
| Time to execute Levenshtein function - 0.216242 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.346668 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.029321 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.037450 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.000885 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. |