| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yaisin (0) - 98 freq yasin (1) - 15 freq raisin (1) - 33 freq yaesin (1) - 2 freq yaissin (1) - 1 freq yaisit (1) - 4 freq yaising (1) - 1 freq yaizin (1) - 1 freq taisin (1) - 1 freq aisin (1) - 1 freq rasin (2) - 1 freq yeusin (2) - 1 freq wailin (2) - 11 freq hausin (2) - 2 freq sainin (2) - 4 freq taison (2) - 1 freq yawnin (2) - 12 freq railin (2) - 12 freq mainin (2) - 3 freq haivin (2) - 3 freq dailin (2) - 1 freq maisie (2) - 242 freq yoosin (2) - 1 freq aisan (2) - 1 freq pailin (2) - 8 freq |
yaisin (0) - 98 freq yaesin (1) - 2 freq aisin (1) - 1 freq yasin (1) - 15 freq uisin (2) - 105 freq easin (2) - 11 freq yoosin (2) - 1 freq aisan (2) - 1 freq yeusin (2) - 1 freq eisin (2) - 1 freq aesin (2) - 2 freq yaising (2) - 1 freq yaissin (2) - 1 freq raisin (2) - 33 freq yaizin (2) - 1 freq yaisit (2) - 4 freq taisin (2) - 1 freq yaise (3) - 255 freq yaisfu (3) - 1 freq yaises (3) - 18 freq yawin (3) - 1 freq nasin (3) - 1 freq maison (3) - 4 freq seiin (3) - 2 freq yairn (3) - 32 freq |
SoundEx code - Y250 yaisin - 98 freq yaukin - 1 freq yakcam - 35 freq 'yakcam' - 2 freq ye-keen - 1 freq yasin - 15 freq yaizin - 1 freq yokin - 24 freq yokkin - 8 freq yoosin - 1 freq yazin - 3 freq yeuchan - 1 freq yican - 1 freq y'know - 5 freq yowchin - 1 freq yokin' - 1 freq y'ken - 2 freq yusan - 2 freq yeukin - 1 freq yaissin - 1 freq yakkin - 2 freq you-ken-who - 1 freq you-ken - 1 freq yokohama - 1 freq yeuchin - 1 freq yeken - 1 freq yeusin - 1 freq yeusan - 1 freq yokhin - 1 freq ycn - 1 freq yikm - 1 freq yaesin - 2 freq yhazony - 1 freq ykn - 1 freq yken - 1 freq |
MetaPhone code - YSN yaisin - 98 freq yasin - 15 freq yaizin - 1 freq yoosin - 1 freq yazin - 3 freq yusan - 2 freq yaissin - 1 freq yeusin - 1 freq yeusan - 1 freq yaesin - 2 freq |
YAISIN |
| Time to execute Levenshtein function - 0.317637 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.571543 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.027506 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.077146 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.001165 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. |