| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yinst (0) - 77 freq yins' (1) - 2 freq yist (1) - 14 freq yins (1) - 467 freq ainst (1) - 2 freq jiist (2) - 1 freq yits (2) - 1 freq uist (2) - 15 freq hin't (2) - 1 freq kirst (2) - 6 freq nint (2) - 4 freq unst (2) - 12 freq yaist (2) - 21 freq minsk (2) - 1 freq mins (2) - 30 freq kin't (2) - 2 freq wanst (2) - 32 freq rins (2) - 101 freq rinse (2) - 8 freq init (2) - 1 freq himst (2) - 3 freq girst (2) - 2 freq jist (2) - 6754 freq ains (2) - 15 freq dist (2) - 18 freq |
yinst (0) - 77 freq ainst (1) - 2 freq unst (2) - 12 freq inset (2) - 2 freq yins' (2) - 2 freq niest (2) - 2 freq yins (2) - 467 freq insta (2) - 2 freq yist (2) - 14 freq yingest (3) - 2 freq rist (3) - 15 freq biest (3) - 1 freq fist (3) - 56 freq noust (3) - 2 freq yuist (3) - 2 freq neast (3) - 1 freq aint (3) - 13 freq yoost (3) - 1 freq uisst (3) - 1 freq cist (3) - 1 freq neist (3) - 561 freq sist (3) - 5 freq yons (3) - 6 freq in't (3) - 42 freq yest (3) - 2 freq |
SoundEx code - Y523 yinst - 77 freq yin-act - 2 freq yanked - 6 freq youngsters - 20 freq yin-street - 1 freq yankit - 1 freq yunkit - 1 freq youngstèrs - 3 freq youngstèrs' - 1 freq yin-sided - 2 freq youngscot - 1 freq yangtze - 1 freq youngster - 2 freq yin-sidit - 1 freq youngwd - 18 freq ynkzdck - 1 freq |
MetaPhone code - YNST yinst - 77 freq |
YINST |
| Time to execute Levenshtein function - 0.183903 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.338856 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.027638 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.037776 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.000972 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. |