| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ex-scorrie-ation (0) - 1 freq correlation (6) - 1 freq co-ordination (7) - 1 freq disconfirmation (7) - 1 freq exasperation (7) - 4 freq exploitation (7) - 9 freq exfoliation (7) - 1 freq exploration (7) - 9 freq correction (7) - 4 freq execration (7) - 1 freq coordination (8) - 1 freq discretion (8) - 7 freq indoctrination (8) - 2 freq €˜scunneration (8) - 1 freq corporation (8) - 5 freq score-in (8) - 2 freq incorruption (8) - 1 freq experimentation (8) - 1 freq inscription (8) - 4 freq prescription (8) - 8 freq scotticisation (8) - 1 freq exhibietion (8) - 1 freq 'exploration (8) - 1 freq hypercorrection (8) - 3 freq tansportation (8) - 1 freq |
ex-scorrie-ation (0) - 1 freq correlation (10) - 1 freq exasperation (11) - 4 freq execration (11) - 1 freq correction (11) - 4 freq insurrection (12) - 2 freq perscription (12) - 2 freq discrimination (12) - 20 freq hypercorrection (12) - 3 freq inscription (12) - 4 freq correctin (12) - 6 freq re-creatin (12) - 1 freq evisceratin (12) - 1 freq descreeption (12) - 1 freq subscription (12) - 4 freq corruption (12) - 27 freq description (12) - 38 freq prescription (12) - 8 freq discretion (12) - 7 freq resurrection (12) - 14 freq incorruption (12) - 1 freq exploration (12) - 9 freq score-in (12) - 2 freq co-ordination (12) - 1 freq disconfirmation (12) - 1 freq |
SoundEx code - E263 exertin - 1 freq ecairt-wheels - 1 freq ecairrit - 1 freq escort - 3 freq esartshall - 1 freq exertion - 3 freq ecairt-cuddy - 1 freq ecairted - 1 freq exert - 1 freq ekurt - 1 freq exerted - 1 freq escortit - 2 freq ex-scorrie-ation - 1 freq esquierdo - 1 freq exertit - 2 freq ecairriet - 1 freq eco-riots - 2 freq exertions - 2 freq escorts - 1 freq escorted - 1 freq eaccreative - 2 freq |
MetaPhone code - EKSSKRXN ex-scorrie-ation - 1 freq |
EX-SCORRIE-ATION |
| Time to execute Levenshtein function - 0.249466 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.432037 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.032429 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.037397 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.000940 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. |