| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larners (0) - 10 freq learners (1) - 6 freq lairners (1) - 72 freq mainers (2) - 2 freq lairners' (2) - 3 freq earner (2) - 2 freq launer (2) - 1 freq ladders (2) - 7 freq larbert (2) - 2 freq loners (2) - 1 freq dargers (2) - 1 freq lagers (2) - 2 freq barbers (2) - 3 freq learner (2) - 7 freq lancers (2) - 4 freq garters (2) - 2 freq larns (2) - 1 freq hauners (2) - 6 freq harness (2) - 14 freq gauners (2) - 1 freq larder (2) - 9 freq barnes (2) - 5 freq liners (2) - 2 freq farmers (2) - 4 freq warner (2) - 1 freq |
larners (0) - 10 freq lairners (1) - 72 freq learners (1) - 6 freq larns (3) - 1 freq learner (3) - 7 freq coarners (3) - 8 freq murners (3) - 1 freq liners (3) - 2 freq sorners (3) - 2 freq burners (3) - 7 freq lairner (3) - 5 freq lairners' (3) - 3 freq corners (3) - 36 freq loners (3) - 1 freq careers (4) - 12 freq markers (4) - 6 freq layers (4) - 20 freq awners (4) - 3 freq sanners (4) - 2 freq hawners (4) - 1 freq larne (4) - 19 freq lasers (4) - 2 freq carers (4) - 11 freq dauners (4) - 5 freq larger (4) - 3 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 - LRNRS lairners - 72 freq learners - 6 freq larners - 10 freq lairners' - 3 freq |
LARNERS |
| Time to execute Levenshtein function - 0.209175 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.568488 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.027616 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.071100 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.000967 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. |