| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yin-but (0) - 2 freq can-but (2) - 4 freq wan-but (2) - 1 freq yin-act (2) - 2 freq is-but (2) - 1 freq us-but (3) - 1 freq in-built (3) - 1 freq -but (3) - 2 freq nou-but (3) - 1 freq yingest (3) - 2 freq minibus (3) - 13 freq input (3) - 4 freq yingist (3) - 1 freq aa-but (3) - 1 freq noo-but (3) - 2 freq --but (3) - 1 freq big-buy (3) - 1 freq yinst (3) - 77 freq yin-man (3) - 2 freq in-bye (3) - 1 freq in-box (3) - 1 freq yin-aff (3) - 1 freq 'b-but (3) - 1 freq '-but (3) - 1 freq b-but (3) - 3 freq |
yin-but (0) - 2 freq nou-but (3) - 1 freq noo-but (3) - 2 freq is-but (3) - 1 freq can-but (3) - 4 freq wan-but (3) - 1 freq yin-act (3) - 2 freq in-bye (4) - 1 freq --but (4) - 1 freq in-box (4) - 1 freq noo-bit (4) - 1 freq in-aboot (4) - 1 freq '-but (4) - 1 freq b-but (4) - 3 freq us-but (4) - 1 freq aa-but (4) - 1 freq -but (4) - 2 freq in-built (4) - 1 freq wee-bit (5) - 6 freq een-at (5) - 1 freq -bit (5) - 1 freq inaboot (5) - 35 freq nisbet (5) - 26 freq inhibit (5) - 2 freq inhabit (5) - 3 freq |
SoundEx code - Y513 yin-but - 2 freq ympteen - 1 freq |
MetaPhone code - YNBT yin-but - 2 freq |
YIN-BUT |
| Time to execute Levenshtein function - 0.377607 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.459835 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.027308 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.037468 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.000880 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. |