| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| corporate (0) - 26 freq cooperate (2) - 2 freq corporately (2) - 1 freq incorporate (2) - 1 freq corporal (2) - 22 freq cormorant (3) - 1 freq coogate (3) - 2 freq co-locate (3) - 1 freq operate (3) - 12 freq incorporat (3) - 1 freq corncrake (3) - 2 freq corporation (3) - 5 freq serperate (3) - 1 freq coorts (4) - 9 freq comforts (4) - 3 freq coronary (4) - 1 freq morrae (4) - 2 freq compare (4) - 59 freq comparative (4) - 2 freq cowgate (4) - 2 freq cordite (4) - 2 freq pirate (4) - 6 freq compar't (4) - 1 freq comparet (4) - 2 freq fornicate (4) - 1 freq |
corporate (0) - 26 freq cooperate (3) - 2 freq corporal (3) - 22 freq incorporate (3) - 1 freq corporately (3) - 1 freq corporation (4) - 5 freq incorporat (4) - 1 freq serperate (4) - 1 freq cornert (5) - 1 freq operate (5) - 12 freq cormorant (5) - 1 freq cornerit (5) - 1 freq comparet (5) - 2 freq airport (5) - 20 freq comparit (5) - 5 freq reporte (5) - 1 freq comperit (5) - 1 freq irrate (6) - 1 freq purported (6) - 1 freq regrate (6) - 1 freq perpetrate (6) - 1 freq compost (6) - 7 freq culprit (6) - 4 freq corpse (6) - 29 freq celebrate (6) - 87 freq |
SoundEx code - C616 carefree - 6 freq carbrini - 1 freq cerebrum - 1 freq carberry - 2 freq caur-parks - 1 freq cerberus - 15 freq car-pairk - 3 freq corporate - 26 freq corporation - 5 freq corporations - 4 freq care-free - 1 freq crawford - 5 freq cerebral - 1 freq crapper - 1 freq cropper - 3 freq carpairk - 1 freq corporal - 22 freq cerbuird - 1 freq crafurds - 1 freq crawfurd - 1 freq creepers - 1 freq crawford's - 2 freq cerberus's - 1 freq chair-frame - 1 freq carpark - 5 freq currieboram - 1 freq carver - 14 freq corporately - 1 freq crobertsonuk - 15 freq corfuarts - 1 freq crawfor - 1 freq crowberries - 1 freq |
MetaPhone code - KRPRT corporate - 26 freq |
CORPORATE |
| Time to execute Levenshtein function - 0.208099 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.473352 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.064194 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.049336 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.001195 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. |