Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lairns (0) - 7 freq lairds (1) - 28 freq lairs (1) - 14 freq lairn (1) - 133 freq lairnt (1) - 54 freq yairns (1) - 14 freq lairgs (1) - 2 freq lairne (1) - 2 freq wairns (1) - 1 freq laerns (1) - 4 freq hairns (1) - 8 freq larns (1) - 1 freq bairns (1) - 1511 freq cairns (1) - 13 freq gairds (2) - 16 freq pairs (2) - 27 freq darns (2) - 1 freq lairge (2) - 23 freq nairn (2) - 6 freq eairds (2) - 2 freq cairnt (2) - 1 freq clairts (2) - 1 freq hair's (2) - 18 freq hairps (2) - 2 freq tairms (2) - 11 freq |
lairns (0) - 7 freq larns (1) - 1 freq laerns (1) - 4 freq hairns (2) - 8 freq bairns (2) - 1511 freq learns (2) - 10 freq wairns (2) - 1 freq cairns (2) - 13 freq lairne (2) - 2 freq lairds (2) - 28 freq lairn (2) - 133 freq lairs (2) - 14 freq lairnt (2) - 54 freq yairns (2) - 14 freq lairgs (2) - 2 freq yarns (3) - 27 freq laern (3) - 13 freq larne (3) - 19 freq ladrons (3) - 1 freq lawins (3) - 1 freq linns (3) - 5 freq tarns (3) - 1 freq lins (3) - 3 freq yaarns (3) - 1 freq lires (3) - 1 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 |
LAIRNS |
Time to execute Levenshtein function - 0.236127 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.373109 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.028621 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.038528 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.000841 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. |