| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yarns (0) - 28 freq tarns (1) - 1 freq harns (1) - 52 freq yairns (1) - 14 freq larns (1) - 1 freq yarn (1) - 49 freq farns (1) - 2 freq yearns (1) - 1 freq yards (1) - 24 freq barns (1) - 8 freq yaarns (1) - 1 freq earns (1) - 3 freq yerns (1) - 1 freq darns (1) - 1 freq warns (1) - 2 freq yawns (1) - 1 freq marts (2) - 4 freq barn's (2) - 1 freq mearns (2) - 6 freq yare (2) - 1 freq harks (2) - 1 freq scarns (2) - 1 freq faras (2) - 1 freq gans (2) - 51 freq ycars (2) - 1 freq |
yarns (0) - 28 freq earns (1) - 3 freq yerns (1) - 1 freq yaarns (1) - 1 freq yearns (1) - 1 freq yairns (1) - 14 freq raans (2) - 2 freq erns (2) - 1 freq urns (2) - 2 freq rns (2) - 5 freq tarns (2) - 1 freq arins (2) - 1 freq rans (2) - 1 freq raens (2) - 2 freq rains (2) - 27 freq yawns (2) - 1 freq yards (2) - 24 freq farns (2) - 2 freq yarn (2) - 49 freq larns (2) - 1 freq harns (2) - 52 freq barns (2) - 8 freq warns (2) - 2 freq darns (2) - 1 freq yairds (3) - 51 freq |
SoundEx code - Y652 yerns - 1 freq yairns - 14 freq yarns - 28 freq yearns - 1 freq 'yooriniss' - 2 freq 'your-anus' - 2 freq yaarns - 1 freq |
MetaPhone code - YRNS yerns - 1 freq yairns - 14 freq yarns - 28 freq yearns - 1 freq 'yooriniss' - 2 freq 'your-anus' - 2 freq yaarns - 1 freq |
YARNS |
| Time to execute Levenshtein function - 0.187265 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.325749 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.027475 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.037352 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.000951 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. |