Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yairns (0) - 14 freq wairns (1) - 1 freq yarns (1) - 27 freq lairns (1) - 7 freq yairn (1) - 32 freq yairds (1) - 51 freq cairns (1) - 13 freq yaarns (1) - 1 freq bairns (1) - 1511 freq hairns (1) - 8 freq birns (2) - 3 freq fairins (2) - 7 freq rains (2) - 27 freq gairds (2) - 16 freq aircs (2) - 1 freq bairks (2) - 1 freq yarn (2) - 49 freq bairnis (2) - 6 freq pairins (2) - 1 freq lairds (2) - 28 freq ymir's (2) - 2 freq pairks (2) - 6 freq lairn (2) - 133 freq yins (2) - 466 freq darns (2) - 1 freq |
yairns (0) - 14 freq yaarns (1) - 1 freq yarns (1) - 27 freq hairns (2) - 8 freq rains (2) - 27 freq yerns (2) - 1 freq bairns (2) - 1511 freq earns (2) - 3 freq yearns (2) - 1 freq cairns (2) - 13 freq yairn (2) - 32 freq wairns (2) - 1 freq yairds (2) - 51 freq lairns (2) - 7 freq arins (3) - 1 freq wains (3) - 13 freq tirns (3) - 4 freq tarns (3) - 1 freq girns (3) - 19 freq larns (3) - 1 freq ruins (3) - 26 freq airnt (3) - 1 freq farns (3) - 2 freq yards (3) - 24 freq irons (3) - 3 freq |
SoundEx code - Y652 yerns - 1 freq yairns - 14 freq yarns - 27 freq yearns - 1 freq 'yooriniss' - 2 freq 'your-anus' - 2 freq yaarns - 1 freq |
MetaPhone code - YRNS yerns - 1 freq yairns - 14 freq yarns - 27 freq yearns - 1 freq 'yooriniss' - 2 freq 'your-anus' - 2 freq yaarns - 1 freq |
YAIRNS |
Time to execute Levenshtein function - 0.193520 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.348347 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.026856 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.037209 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.000842 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. |