| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| editin (0) - 22 freq editing (1) - 3 freq evitin (1) - 4 freq edition (1) - 27 freq editin' (1) - 1 freq editit (1) - 6 freq writin (2) - 355 freq fitin (2) - 4 freq pitin (2) - 1 freq suitin (2) - 1 freq eatin (2) - 154 freq edwin (2) - 29 freq witin (2) - 1 freq exiting (2) - 1 freq citin (2) - 1 freq ettin (2) - 13 freq eetin (2) - 3 freq baitin (2) - 1 freq dinin (2) - 24 freq teitin (2) - 1 freq edit (2) - 17 freq whitin (2) - 25 freq eltin (2) - 1 freq evitit (2) - 2 freq edgin (2) - 3 freq |
editin (0) - 22 freq edition (1) - 27 freq dotin (2) - 2 freq editioun (2) - 2 freq edeition (2) - 13 freq datin (2) - 11 freq editit (2) - 6 freq editing (2) - 3 freq doitin (2) - 3 freq evitin (2) - 4 freq editin' (2) - 1 freq fuitin (3) - 2 freq editions (3) - 4 freq edeetion (3) - 12 freq eitan (3) - 1 freq puitin (3) - 2 freq saitin (3) - 3 freq edeitioun (3) - 8 freq maitin (3) - 1 freq aitin (3) - 21 freq ditit (3) - 1 freq divin (3) - 13 freq bitin (3) - 27 freq dtn (3) - 1 freq laitin (3) - 19 freq |
SoundEx code - E335 edeitions - 3 freq edition - 27 freq editin - 22 freq edeition - 13 freq editing - 3 freq editin' - 1 freq edeetion - 12 freq editioun - 2 freq edeitioun - 8 freq editions - 4 freq edeitiouns - 1 freq editiouns - 1 freq edeetions - 1 freq |
MetaPhone code - ETTN editin - 22 freq editin' - 1 freq |
EDITIN |
| Time to execute Levenshtein function - 0.199049 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.360081 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.028074 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.037815 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.000833 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. |