| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sixtiet (0) - 1 freq sixtie (1) - 3 freq sixties (1) - 15 freq sixtieth (1) - 3 freq mixtie (2) - 2 freq sixteen (2) - 44 freq sintit (2) - 3 freq siftit (2) - 1 freq fiftiet (2) - 1 freq sixteent (2) - 3 freq saxties (2) - 4 freq saxtie (2) - 6 freq sties (3) - 1 freq sickies (3) - 2 freq six-fit (3) - 2 freq kistie (3) - 14 freq lilties (3) - 2 freq skytit (3) - 9 freq listet (3) - 1 freq saitit (3) - 2 freq tittit (3) - 11 freq dittit (3) - 1 freq twintiet (3) - 4 freq kiltie (3) - 5 freq littie (3) - 1 freq |
sixtiet (0) - 1 freq sixties (2) - 15 freq sixtieth (2) - 3 freq sixtie (2) - 3 freq sixteent (3) - 3 freq saxtie (3) - 6 freq siftit (3) - 1 freq saxties (3) - 4 freq sintit (3) - 3 freq sixteen (3) - 44 freq sexiest (4) - 4 freq sixth (4) - 18 freq skitit (4) - 15 freq slatit (4) - 1 freq sixt (4) - 5 freq saltet (4) - 1 freq seatit (4) - 7 freq suitet (4) - 3 freq santit (4) - 2 freq sortet (4) - 4 freq staet (4) - 6 freq sautit (4) - 2 freq sortit (4) - 51 freq saxteent (4) - 4 freq suitit (4) - 8 freq |
SoundEx code - S233 sichtit - 7 freq sixty-twa - 1 freq sichted - 4 freq shockheided - 1 freq succeedit - 6 freq succeeded - 8 freq sixtieth - 3 freq saxty-three - 2 freq sixtiet - 1 freq sechtit - 3 freq sixty-three - 1 freq sighted - 2 freq shaested - 1 freq sashatitch - 1 freq |
MetaPhone code - SKSTT suggestit - 48 freq suggested - 31 freq succeedit - 6 freq succeeded - 8 freq suggestet - 1 freq sixtiet - 1 freq |
SIXTIET |
| Time to execute Levenshtein function - 0.575422 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.828478 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.082326 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.099047 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.000884 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. |