| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edeitioun (0) - 8 freq editioun (1) - 2 freq edeition (1) - 13 freq edeitiouns (1) - 1 freq edeetion (2) - 12 freq edition (2) - 27 freq edeitions (2) - 3 freq additioun (2) - 1 freq rendeitioun (2) - 1 freq editiouns (2) - 1 freq election (3) - 87 freq peteition (3) - 1 freq exertion (3) - 4 freq redactioun (3) - 1 freq eleision (3) - 1 freq ambeitioun (3) - 1 freq deceisioun (3) - 2 freq addition (3) - 17 freq opeinioun (3) - 4 freq creatioun (3) - 1 freq rendeition (3) - 1 freq sedition (3) - 7 freq receptioun (3) - 1 freq addeition (3) - 3 freq editions (3) - 4 freq |
edeitioun (0) - 8 freq edeition (1) - 13 freq editioun (1) - 2 freq edeitiouns (2) - 1 freq edition (2) - 27 freq edeetion (2) - 12 freq editiouns (3) - 1 freq editin (3) - 22 freq additioun (3) - 1 freq edeitions (3) - 3 freq dictioun (4) - 1 freq edeetions (4) - 1 freq addeition (4) - 3 freq addeetioun (4) - 2 freq editions (4) - 4 freq audition (4) - 8 freq doitin (4) - 3 freq sedition (4) - 7 freq etioun (4) - 2 freq naitioun (4) - 7 freq educatioun (4) - 7 freq rendeitioun (4) - 1 freq addition (4) - 17 freq emotion (5) - 18 freq editin' (5) - 1 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 |
EDEITIOUN |
| Time to execute Levenshtein function - 0.188479 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.333342 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.027070 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.036533 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.000796 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. |