| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| editioun (0) - 2 freq edition (1) - 27 freq edeitioun (1) - 8 freq editiouns (1) - 1 freq edeition (2) - 13 freq editin (2) - 22 freq sedition (2) - 7 freq etioun (2) - 2 freq dictioun (2) - 1 freq edeitiouns (2) - 1 freq naitioun (2) - 7 freq additioun (2) - 1 freq editions (2) - 4 freq sectioun (3) - 7 freq dedicatioun (3) - 1 freq orisioun (3) - 1 freq perdition (3) - 1 freq addition (3) - 17 freq actioun (3) - 15 freq audition (3) - 8 freq mentioun (3) - 1 freq naition (3) - 1 freq religioun (3) - 5 freq editit (3) - 6 freq veisioun (3) - 2 freq |
editioun (0) - 2 freq edeitioun (1) - 8 freq edition (1) - 27 freq editin (2) - 22 freq edeition (2) - 13 freq editiouns (2) - 1 freq additioun (3) - 1 freq editions (3) - 4 freq naitioun (3) - 7 freq edeetion (3) - 12 freq audition (3) - 8 freq sedition (3) - 7 freq edeitiouns (3) - 1 freq etioun (3) - 2 freq dictioun (3) - 1 freq elation (4) - 3 freq emotion (4) - 19 freq diction (4) - 9 freq mautioun (4) - 1 freq editing (4) - 3 freq optioun (4) - 1 freq editin' (4) - 1 freq edication (4) - 3 freq ection (4) - 16 freq educatioun (4) - 7 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 - ETXN edition - 27 freq edeition - 13 freq edeetion - 12 freq editioun - 2 freq edeitioun - 8 freq |
EDITIOUN |
| Time to execute Levenshtein function - 1.107425 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 - 1.296989 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.108147 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.179620 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.000957 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. |