Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yarns (0) - 27 freq yaarns (1) - 1 freq larns (1) - 1 freq darns (1) - 1 freq yarn (1) - 49 freq yawns (1) - 1 freq warns (1) - 2 freq yards (1) - 24 freq harns (1) - 52 freq yearns (1) - 1 freq barns (1) - 8 freq earns (1) - 3 freq yairns (1) - 14 freq yerns (1) - 1 freq farns (1) - 2 freq tarns (1) - 1 freq yalls (2) - 2 freq ear's (2) - 1 freq gans (2) - 51 freq wares (2) - 6 freq carna (2) - 1 freq rains (2) - 27 freq bars (2) - 86 freq arks (2) - 1 freq yrs (2) - 16 freq |
yarns (0) - 27 freq yearns (1) - 1 freq earns (1) - 3 freq yairns (1) - 14 freq yaarns (1) - 1 freq yerns (1) - 1 freq rains (2) - 27 freq urns (2) - 2 freq raans (2) - 2 freq arins (2) - 1 freq raens (2) - 2 freq rans (2) - 1 freq tarns (2) - 1 freq rns (2) - 5 freq erns (2) - 1 freq harns (2) - 52 freq yawns (2) - 1 freq darns (2) - 1 freq yards (2) - 24 freq warns (2) - 2 freq farns (2) - 2 freq barns (2) - 8 freq larns (2) - 1 freq yarn (2) - 49 freq burns (3) - 359 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 |
YARNS |
Time to execute Levenshtein function - 0.222535 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.346906 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.029321 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.037373 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.000820 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. |