| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yawin (0) - 1 freq cawin (1) - 62 freq mawin (1) - 2 freq jawin (1) - 2 freq yasin (1) - 15 freq fawin (1) - 88 freq sawin (1) - 11 freq hawin (1) - 2 freq yawnin (1) - 12 freq yawn (1) - 12 freq yanin (1) - 1 freq yazin (1) - 3 freq pawin (1) - 3 freq yaain (1) - 1 freq dawin (1) - 32 freq gawin (1) - 26 freq awin (1) - 5 freq lawin (1) - 2 freq fa-in (2) - 1 freq wadin (2) - 2 freq yokin (2) - 24 freq haein (2) - 661 freq easin (2) - 11 freq snawin (2) - 6 freq myowin (2) - 1 freq |
yawin (0) - 1 freq yawn (1) - 12 freq awin (1) - 5 freq wayin (2) - 1 freq win (2) - 980 freq jawin (2) - 2 freq lawin (2) - 2 freq waein (2) - 1 freq awan (2) - 1 freq wain (2) - 15 freq ewin (2) - 1 freq awn (2) - 118 freq cawin (2) - 62 freq gawin (2) - 26 freq oawn (2) - 1 freq hawin (2) - 2 freq dawin (2) - 32 freq sawin (2) - 11 freq fawin (2) - 88 freq yasin (2) - 15 freq mawin (2) - 2 freq yawnin (2) - 12 freq yaain (2) - 1 freq pawin (2) - 3 freq yazin (2) - 3 freq |
SoundEx code - Y500 yin - 3094 freq yon - 1565 freq yuan - 8 freq 'yon - 14 freq 'yin - 10 freq yinee - 5 freq yun - 140 freq yn - 6 freq yawin - 1 freq yaan - 9 freq yoo-hooin - 1 freq yawn - 12 freq yin' - 5 freq yon' - 2 freq yoam - 5 freq yome - 2 freq yim - 1 freq ym - 2 freq yoonne - 1 freq yan - 1 freq yaain - 1 freq yum - 22 freq yam - 2 freq yn - 1 freq y'm - 1 freq 'yin' - 2 freq yone - 7 freq yon - 5 freq Ðyn - 1 freq yin - 2 freq yom - 1 freq yin - 4 freq yon - 2 freq yüen - 1 freq yon - 1 freq yum - 1 freq yon - 1 freq yin - 2 freq 'yon' - 1 freq yona - 12 freq yoon - 6 freq ymm - 1 freq yyhn - 1 freq yynno - 1 freq yhn - 2 freq ynu - 9 freq yummy - 2 freq yin - 1 freq yoeim - 1 freq 'yum' - 1 freq |
MetaPhone code - YWN yawin - 1 freq hyowin - 2 freq |
YAWIN |
| Time to execute Levenshtein function - 0.202394 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.338850 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.033923 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.038495 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.000926 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. |