| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| corporal (0) - 22 freq corral (2) - 2 freq corporate (2) - 26 freq incorporat (3) - 1 freq temporal (3) - 8 freq coral (3) - 5 freq choral (3) - 2 freq cormorant (3) - 1 freq rooral (3) - 1 freq gomoral (3) - 1 freq cerebral (3) - 1 freq corporately (3) - 1 freq orral (3) - 6 freq cordial (3) - 6 freq corona (3) - 19 freq rora (4) - 2 freq corrie (4) - 55 freq cursory (4) - 5 freq norroway (4) - 7 freq coimbra (4) - 1 freq colonial (4) - 8 freq croas (4) - 1 freq coeecrml (4) - 1 freq composer (4) - 3 freq conjugal (4) - 2 freq |
corporal (0) - 22 freq corporate (3) - 26 freq corral (3) - 2 freq corporately (4) - 1 freq cerebral (4) - 1 freq coral (5) - 5 freq cordial (5) - 6 freq carpark (5) - 5 freq incorporat (5) - 1 freq orral (5) - 6 freq rooral (5) - 1 freq choral (5) - 2 freq temporal (5) - 8 freq compare (6) - 58 freq cromar (6) - 1 freq crerar (6) - 1 freq culural (6) - 1 freq rural (6) - 28 freq comparable (6) - 7 freq corporation (6) - 5 freq crowl (6) - 1 freq coronary (6) - 1 freq cupola (6) - 1 freq coppers (6) - 9 freq corp (6) - 51 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 - KRPRL corporal - 22 freq |
CORPORAL |
| Time to execute Levenshtein function - 0.208497 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.380368 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.027844 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.036762 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.000824 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. |