| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chaseyerself (0) - 1 freq yerself (5) - 17 freq haersel (5) - 1 freq chasteised (5) - 1 freq cheesel (5) - 1 freq herself (5) - 41 freq chairters (6) - 2 freq yirself (6) - 5 freq chessel (6) - 1 freq caperers (6) - 1 freq yersel (6) - 920 freq charnel (6) - 2 freq heezsel (6) - 1 freq chastise (6) - 1 freq cheesers (6) - 2 freq chaummers (6) - 1 freq conversely (6) - 2 freq careerne (6) - 1 freq chambertalk (6) - 5 freq hersef (6) - 1 freq hersell (6) - 12 freq yaersels (6) - 1 freq hersel (6) - 1059 freq caterers (6) - 1 freq chesell (6) - 1 freq |
chaseyerself (0) - 1 freq herself (7) - 41 freq cheesers (8) - 2 freq chessel (8) - 1 freq hurself (8) - 1 freq hisself (8) - 3 freq cheesel (8) - 1 freq haersel (8) - 1 freq chasteised (8) - 1 freq yerself (8) - 17 freq cheerily (9) - 5 freq cheerly (9) - 1 freq cheeses (9) - 1 freq thyself (9) - 1 freq phasers (9) - 1 freq chasies (9) - 1 freq cheeriest (9) - 1 freq masself (9) - 3 freq cheeters (9) - 1 freq themself (9) - 1 freq thiersels (9) - 1 freq thersels (9) - 2 freq hirselfe (9) - 1 freq theirsels (9) - 212 freq chasse (9) - 2 freq |
SoundEx code - C262 cheshire-cat - 25 freq cheshire-cats - 4 freq cheshire-cheetie - 2 freq cucaracha' - 1 freq choosers - 2 freq cigars - 5 freq cheesers - 2 freq caesar's - 4 freq chakkers - 2 freq cowsers - 1 freq cockroaches - 3 freq cucuracha - 1 freq coosers - 1 freq chuckers - 1 freq cookiris - 4 freq cxejerkcg - 1 freq chokkers - 1 freq chaseyerself - 1 freq |
MetaPhone code - XSYRSLF chaseyerself - 1 freq |
CHASEYERSELF |
| Time to execute Levenshtein function - 0.209559 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.388244 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.027965 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.040749 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.000988 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. |