| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| learns (0) - 10 freq learnt (1) - 153 freq learnd (1) - 1 freq larns (1) - 1 freq leains (1) - 3 freq earns (1) - 3 freq learn (1) - 287 freq mearns (1) - 6 freq yearns (1) - 1 freq lear's (1) - 1 freq leans (1) - 16 freq lears (1) - 2 freq cleans (2) - 9 freq lea's (2) - 2 freq learned (2) - 78 freq lanns (2) - 2 freq laens (2) - 1 freq hears (2) - 46 freq scarns (2) - 1 freq yaarns (2) - 1 freq learnen (2) - 1 freq leern (2) - 1 freq beards (2) - 12 freq learners (2) - 6 freq gleans (2) - 1 freq |
learns (0) - 10 freq larns (1) - 1 freq lear's (2) - 1 freq lears (2) - 2 freq laerns (2) - 4 freq yearns (2) - 1 freq lairns (2) - 7 freq leans (2) - 16 freq mearns (2) - 6 freq learnt (2) - 153 freq learnd (2) - 1 freq leains (2) - 3 freq earns (2) - 3 freq learn (2) - 287 freq yarns (3) - 27 freq learner (3) - 7 freq learnin (3) - 106 freq bearins (3) - 9 freq lerne (3) - 1 freq leanins (3) - 1 freq barns (3) - 8 freq leavans (3) - 1 freq harns (3) - 52 freq ferns (3) - 7 freq terns (3) - 2 freq |
SoundEx code - L652 lowering - 2 freq learns - 10 freq lairns - 7 freq larns - 1 freq larynx - 2 freq lauren's - 2 freq laurence - 10 freq laerns - 4 freq louring - 1 freq luring - 1 freq lawrence - 5 freq lawrenson - 1 freq lauramaxwell - 1 freq lairnscots - 99 freq lawriemk - 1 freq lornmac - 1 freq laurenoxleyx - 2 freq louhairmakeup - 1 freq lruunyz - 1 freq lornaslater - 1 freq laurencefindlay - 3 freq lorenzo - 1 freq learnsomethingeveryday - 1 freq |
MetaPhone code - LRNS learns - 10 freq lairns - 7 freq larns - 1 freq lauren's - 2 freq laurence - 10 freq laerns - 4 freq lawrence - 5 freq lruunyz - 1 freq lorenzo - 1 freq |
LEARNS |
| Time to execute Levenshtein function - 0.179095 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.355980 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.031199 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.039806 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.000787 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. |