| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zhkstn (0) - 1 freq chest (3) - 101 freq nekst (3) - 1 freq whatn (3) - 1 freq zimsen (3) - 1 freq aksin (3) - 13 freq lhsten (3) - 1 freq hostin (3) - 16 freq histy (3) - 1 freq thesltn (3) - 2 freq zest (3) - 2 freq chasan (3) - 2 freq zkots (3) - 4 freq zxst (3) - 1 freq hysts (3) - 1 freq zukt (3) - 1 freq zhws (3) - 1 freq chyst (3) - 1 freq whists (3) - 1 freq akst (3) - 12 freq chisty (3) - 1 freq hsten (3) - 1 freq hsun (3) - 2 freq hosts (3) - 13 freq haste (3) - 37 freq |
zhkstn (0) - 1 freq hasten (5) - 1 freq shastin (5) - 1 freq chastin (5) - 1 freq lhsten (5) - 1 freq hostin (5) - 16 freq hsten (5) - 1 freq heston (5) - 1 freq whist (6) - 5 freq 'host' (6) - 1 freq zhuan (6) - 1 freq ahsan (6) - 1 freq chiste (6) - 1 freq ghosty (6) - 1 freq chestane (6) - 1 freq ghost' (6) - 1 freq hyst (6) - 5 freq zhat (6) - 1 freq hast (6) - 2 freq hyste (6) - 9 freq hst (6) - 1 freq chysen (6) - 1 freq host (6) - 37 freq chaste (6) - 1 freq phkan (6) - 1 freq |
SoundEx code - Z235 zhkstn - 1 freq |
MetaPhone code - SKSTN saxteen - 25 freq sixteen - 44 freq 'sixteen' - 1 freq suggestin' - 2 freq 'sixteen - 1 freq succeedin - 2 freq suggestin - 13 freq sïxtaen - 1 freq suggestan - 1 freq zhkstn - 1 freq sextin - 1 freq |
ZHKSTN |
| Time to execute Levenshtein function - 0.354217 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.798265 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.093898 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.100282 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.000890 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. |