Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eerjeestnoclueduprite (0) - 1 freq leereynoldsdup (12) - 2 freq eernest-like (12) - 1 freq serendipity (13) - 1 freq perennialunder (13) - 1 freq weel-tochert (13) - 2 freq reinterprete (13) - 1 freq afftaethecludgie (13) - 1 freq professoredith (13) - 1 freq heeligoleerie (13) - 3 freq parteecularity (13) - 1 freq bare-scuddie (13) - 1 freq heiliegoleirie (13) - 4 freq heeliegoleerie (13) - 3 freq restaurit (13) - 1 freq resoundinlie (13) - 1 freq preterite (13) - 2 freq epistolarie (13) - 2 freq reestled (13) - 1 freq meesterie (13) - 7 freq parteeclarity (13) - 1 freq greenerie (13) - 1 freq weel-educate (13) - 2 freq resolute (13) - 8 freq heelstergoudie (13) - 1 freq |
eerjeestnoclueduprite (0) - 1 freq reestled (19) - 1 freq restaurit (19) - 1 freq distancepit (19) - 1 freq parteeclarity (19) - 1 freq westcalderutd (19) - 1 freq parteecularity (19) - 1 freq aristocrat (19) - 1 freq serendipity (19) - 1 freq eernest-like (19) - 1 freq reinterprete (19) - 1 freq aristocrats (20) - 2 freq rashknockerty (20) - 1 freq staundart (20) - 68 freq sclidderie (20) - 2 freq jimspencesport (20) - 25 freq particularity (20) - 1 freq restrictit (20) - 4 freq restalrig (20) - 1 freq solidarity (20) - 23 freq restoret (20) - 1 freq re-establishit (20) - 1 freq juist-depairts (20) - 1 freq restrickit (20) - 5 freq concludit (20) - 7 freq |
SoundEx code - E622 erses - 23 freq erchie's - 6 freq erika's - 2 freq erikasbairn - 1 freq erches - 1 freq erzygfvwvl - 1 freq eerjeestnoclueduprite - 1 freq ericajanepoet - 2 freq |
MetaPhone code - ERJSTNKL |
EERJEESTNOCLUEDUPRITE |
Time to execute Levenshtein function - 0.282055 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.414426 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.027334 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.041714 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.000963 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. |