Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
learner (0) - 7 freq earner (1) - 2 freq learned (1) - 78 freq learners (1) - 6 freq learnen (1) - 1 freq coarner (2) - 46 freq lerned (2) - 1 freq larne (2) - 19 freq learnd (2) - 1 freq leaned (2) - 40 freq learnin (2) - 106 freq leared (2) - 1 freq earned (2) - 17 freq launer (2) - 1 freq leather (2) - 75 freq larned (2) - 12 freq dearer (2) - 8 freq learnt (2) - 153 freq lerne (2) - 1 freq larger (2) - 3 freq learns (2) - 10 freq learnit (2) - 12 freq nearer (2) - 72 freq larder (2) - 9 freq leader (2) - 58 freq |
learner (0) - 7 freq learnen (2) - 1 freq learners (2) - 6 freq lairner (2) - 5 freq earner (2) - 2 freq learned (2) - 78 freq learnit (3) - 12 freq learns (3) - 10 freq larger (3) - 3 freq lerne (3) - 1 freq larder (3) - 9 freq werner (3) - 1 freq larners (3) - 10 freq learn (3) - 287 freq learnt (3) - 153 freq warner (3) - 1 freq learnan (3) - 2 freq learnin (3) - 106 freq coarner (3) - 46 freq learnd (3) - 1 freq larne (3) - 19 freq lerned (3) - 1 freq larned (3) - 12 freq launer (3) - 1 freq lernit (4) - 1 freq |
SoundEx code - L656 lorimer's - 9 freq lairners - 72 freq learner - 7 freq lorimers - 1 freq lorimer - 30 freq learners - 6 freq larners - 10 freq lairner - 5 freq lorrimer - 1 freq lairners' - 3 freq |
MetaPhone code - LRNR learner - 7 freq lairner - 5 freq |
LEARNER |
Time to execute Levenshtein function - 0.192644 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.364899 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.028427 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.036965 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.000868 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. |