Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lairners (0) - 72 freq lairner (1) - 5 freq larners (1) - 10 freq lairners' (1) - 3 freq sairvers (2) - 1 freq lairns (2) - 7 freq lairned (2) - 14 freq pairtners (2) - 19 freq bairneys (2) - 1 freq learners (2) - 6 freq fairness (2) - 11 freq mainners (2) - 20 freq liners (2) - 2 freq gairdners (2) - 18 freq lairnins (2) - 1 freq mainers (2) - 2 freq lairne (2) - 2 freq mairkers (2) - 1 freq lairger (2) - 10 freq lairless (2) - 1 freq fairmers (2) - 38 freq gairters (2) - 1 freq sairness (2) - 8 freq cairters (2) - 1 freq lancers (3) - 4 freq |
lairners (0) - 72 freq larners (1) - 10 freq learners (2) - 6 freq lairners' (2) - 3 freq lairner (2) - 5 freq liners (3) - 2 freq lairnins (3) - 1 freq lairns (3) - 7 freq cairters (4) - 1 freq learner (4) - 8 freq laerns (4) - 4 freq loners (4) - 1 freq larries (4) - 8 freq corners (4) - 36 freq sorners (4) - 2 freq larns (4) - 1 freq murners (4) - 1 freq burners (4) - 7 freq trainers (4) - 48 freq sairness (4) - 8 freq coarners (4) - 9 freq mourners (4) - 6 freq mainers (4) - 2 freq lairne (4) - 2 freq gairters (4) - 1 freq |
SoundEx code - L656 lorimer's - 9 freq learner - 8 freq lairners - 72 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.272330 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.561497 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.032523 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.068646 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.000917 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. |