Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yarn (0) - 49 freq yare (1) - 1 freq yirn (1) - 3 freq yairn (1) - 32 freq yard (1) - 43 freq warn (1) - 35 freq yarl (1) - 18 freq darn (1) - 3 freq yar (1) - 3 freq yearn (1) - 1 freq yawn (1) - 12 freq karn (1) - 7 freq harn (1) - 5 freq yarns (1) - 28 freq yan (1) - 1 freq carn (1) - 1 freq barn (1) - 68 freq larn (1) - 16 freq yaan (1) - 9 freq yark (1) - 8 freq earn (1) - 41 freq ycn (2) - 1 freq yasin (2) - 15 freq ayrn (2) - 1 freq yarned (2) - 2 freq |
yarn (0) - 49 freq yearn (1) - 1 freq earn (1) - 41 freq yairn (1) - 32 freq yirn (1) - 3 freq airn (2) - 52 freq ryan (2) - 32 freq aaron (2) - 5 freq rain (2) - 686 freq urn (2) - 6 freq arna (2) - 23 freq arni (2) - 3 freq aren (2) - 3 freq ryaan (2) - 8 freq aran (2) - 5 freq iyurn (2) - 2 freq arun (2) - 2 freq rn (2) - 7 freq ran (2) - 451 freq ayrn (2) - 1 freq ern (2) - 14 freq arne (2) - 1 freq irn (2) - 35 freq warn (2) - 35 freq yard (2) - 43 freq |
SoundEx code - Y650 yairn - 32 freq yarn - 49 freq yearn - 1 freq year-en - 1 freq year-roon - 1 freq yirn - 3 freq 'yairn - 1 freq |
MetaPhone code - YRN yairn - 32 freq yarn - 49 freq yearn - 1 freq year-en - 1 freq yirn - 3 freq 'yairn - 1 freq |
YARN |
Time to execute Levenshtein function - 0.199591 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.317971 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.027689 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.037206 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.000909 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. |