| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairners (0) - 72 freq larners (1) - 10 freq lairners' (1) - 3 freq lairner (1) - 5 freq mainers (2) - 2 freq lairne (2) - 2 freq mairkers (2) - 1 freq lairns (2) - 7 freq gairdners (2) - 18 freq lairger (2) - 9 freq fairmers (2) - 35 freq gairters (2) - 1 freq lairnins (2) - 1 freq fairness (2) - 11 freq lairned (2) - 14 freq sairvers (2) - 1 freq bairneys (2) - 1 freq liners (2) - 2 freq sairness (2) - 8 freq learners (2) - 6 freq cairters (2) - 1 freq mainners (2) - 20 freq pairtners (2) - 19 freq lairless (2) - 1 freq leipers (3) - 2 freq |
lairners (0) - 72 freq larners (1) - 10 freq learners (2) - 6 freq lairner (2) - 5 freq lairners' (2) - 3 freq lairns (3) - 7 freq liners (3) - 2 freq lairnins (3) - 1 freq sorners (4) - 2 freq larries (4) - 8 freq lairless (4) - 1 freq learner (4) - 7 freq loners (4) - 1 freq mourners (4) - 6 freq murners (4) - 1 freq burners (4) - 7 freq coarners (4) - 8 freq trainers (4) - 46 freq pairtners (4) - 19 freq corners (4) - 36 freq laerns (4) - 4 freq larns (4) - 1 freq fairness (4) - 11 freq lairned (4) - 14 freq gairdners (4) - 18 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 |
LAIRNERS |
| Time to execute Levenshtein function - 0.190507 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.339975 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.027403 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.036715 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.000807 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. |