| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yairn (0) - 32 freq wairn (1) - 2 freq kairn (1) - 1 freq bairn (1) - 785 freq 'yairn (1) - 1 freq nairn (1) - 6 freq airn (1) - 50 freq yarn (1) - 49 freq lairn (1) - 133 freq yaird (1) - 88 freq yairns (1) - 14 freq cairn (1) - 43 freq yair (1) - 1 freq gairn (1) - 1 freq yirn (1) - 3 freq kain (2) - 2 freq dairy (2) - 28 freq rairs (2) - 3 freq gairs (2) - 1 freq waarn (2) - 1 freq wain (2) - 15 freq sairs (2) - 8 freq rairt (2) - 1 freq nain (2) - 5 freq airm (2) - 358 freq |
yairn (0) - 32 freq airn (1) - 50 freq yarn (1) - 49 freq yirn (1) - 3 freq airin (2) - 4 freq earn (2) - 41 freq gairn (2) - 1 freq rain (2) - 682 freq airon (2) - 1 freq yearn (2) - 1 freq irn (2) - 35 freq yair (2) - 1 freq ayrn (2) - 1 freq 'yairn (2) - 1 freq cairn (2) - 43 freq kairn (2) - 1 freq wairn (2) - 2 freq nairn (2) - 6 freq bairn (2) - 785 freq lairn (2) - 133 freq yairns (2) - 14 freq yaird (2) - 88 freq yar (3) - 3 freq bain (3) - 77 freq yaan (3) - 9 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 |
YAIRN |
| Time to execute Levenshtein function - 0.191388 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.376140 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.027588 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.037376 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.000942 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. |