| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larns (0) - 1 freq yarns (1) - 28 freq laens (1) - 1 freq largs (1) - 4 freq tarns (1) - 1 freq laerns (1) - 4 freq warns (1) - 2 freq lairns (1) - 7 freq earns (1) - 3 freq lans (1) - 15 freq launs (1) - 17 freq farns (1) - 2 freq barns (1) - 8 freq larks (1) - 4 freq lawns (1) - 3 freq lanns (1) - 2 freq larnt (1) - 13 freq lars (1) - 1 freq larn (1) - 16 freq larne (1) - 19 freq darns (1) - 1 freq learns (1) - 10 freq harns (1) - 52 freq anns (2) - 1 freq lambs (2) - 57 freq |
larns (0) - 1 freq lairns (1) - 7 freq learns (1) - 10 freq laerns (1) - 4 freq larnt (2) - 13 freq lanns (2) - 2 freq lawns (2) - 3 freq lars (2) - 1 freq harns (2) - 52 freq larks (2) - 4 freq larne (2) - 19 freq darns (2) - 1 freq larn (2) - 16 freq tarns (2) - 1 freq laens (2) - 1 freq barns (2) - 8 freq yarns (2) - 28 freq warns (2) - 2 freq largs (2) - 4 freq launs (2) - 17 freq farns (2) - 2 freq lans (2) - 15 freq earns (2) - 3 freq farins (3) - 1 freq lairds (3) - 28 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 |
LARNS |
| Time to execute Levenshtein function - 0.227090 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.471444 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.032484 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.041643 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.000892 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. |