| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oxidation (0) - 1 freq edication (3) - 3 freq domination (3) - 1 freq agitation (3) - 5 freq oration (3) - 1 freq obligation (3) - 6 freq imitation (3) - 4 freq operation (3) - 41 freq foundation (3) - 12 freq fixation (3) - 1 freq citation (3) - 2 freq foondation (3) - 6 freq nomination (3) - 1 freq animation (3) - 6 freq predation (3) - 1 freq validation (3) - 2 freq motivation (3) - 11 freq medication (4) - 8 freq duration (4) - 5 freq operatin (4) - 9 freq oppostion (4) - 1 freq orientation (4) - 1 freq ruinaetion (4) - 1 freq litigation (4) - 1 freq vibration (4) - 4 freq |
oxidation (0) - 1 freq datin (5) - 11 freq exibitien (5) - 3 freq addition (5) - 17 freq audition (5) - 8 freq existin (5) - 24 freq exertion (5) - 3 freq edition (5) - 27 freq sedition (5) - 7 freq apdatin (5) - 2 freq expedition (5) - 3 freq execution (5) - 18 freq mediation (5) - 4 freq updatin (5) - 4 freq validation (5) - 2 freq radiation (5) - 3 freq foondation (5) - 6 freq oration (5) - 1 freq imitation (5) - 4 freq fixation (5) - 1 freq animation (5) - 6 freq predation (5) - 1 freq agitation (5) - 5 freq foundation (5) - 12 freq citation (5) - 2 freq |
SoundEx code - O233 ostid - 1 freq oxidation - 1 freq oxdiatmvku - 1 freq |
MetaPhone code - OKSTXN oxidation - 1 freq |
OXIDATION |
| Time to execute Levenshtein function - 0.352517 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.630512 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.060086 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.040389 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.000976 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. |