| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| learntit (0) - 1 freq learnit (1) - 12 freq lantit (2) - 1 freq lernit (2) - 1 freq learnt (2) - 153 freq feartit (2) - 1 freq learn't (2) - 9 freq learit (2) - 3 freq learnin (2) - 106 freq learning (3) - 33 freq tauntit (3) - 2 freq lernt (3) - 4 freq leernt (3) - 2 freq lastit (3) - 13 freq pentit (3) - 44 freq learnins (3) - 1 freq laandit (3) - 4 freq cantit (3) - 1 freq bleatit (3) - 2 freq reprentit (3) - 1 freq earnin (3) - 7 freq leimitit (3) - 6 freq peyntit (3) - 2 freq learned (3) - 78 freq eatit (3) - 1 freq |
learntit (0) - 1 freq learnit (2) - 12 freq learnt (3) - 153 freq learn't (3) - 9 freq lernit (3) - 1 freq lantit (3) - 1 freq lamentit (4) - 1 freq larnt (4) - 13 freq rentit (4) - 6 freq grantit (4) - 30 freq alertit (4) - 2 freq rantit (4) - 1 freq luntit (4) - 3 freq leernt (4) - 2 freq lairnit (4) - 5 freq learit (4) - 3 freq lernt (4) - 4 freq feartit (4) - 1 freq learnin (4) - 106 freq clartit (5) - 15 freq plantit (5) - 35 freq dementit (5) - 22 freq learin (5) - 8 freq fentit (5) - 3 freq lannit (5) - 3 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 - LRNTT learntit - 1 freq |
LEARNTIT |
| Time to execute Levenshtein function - 0.215442 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.392219 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.028393 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.037937 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.001058 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. |