| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edition (0) - 27 freq editioun (1) - 2 freq sedition (1) - 7 freq editin (1) - 22 freq editions (1) - 4 freq edeition (1) - 13 freq tuition (2) - 7 freq editin' (2) - 1 freq editit (2) - 6 freq elision (2) - 2 freq petition (2) - 11 freq emotion (2) - 19 freq editiouns (2) - 1 freq perdition (2) - 1 freq rendition (2) - 6 freq eviction (2) - 2 freq edeetion (2) - 12 freq editor (2) - 70 freq ection (2) - 16 freq editing (2) - 3 freq edeitioun (2) - 8 freq audition (2) - 8 freq edeitions (2) - 3 freq naition (2) - 1 freq evitin (2) - 4 freq |
edition (0) - 27 freq editin (1) - 22 freq edeition (1) - 13 freq editioun (1) - 2 freq edeetion (2) - 12 freq sedition (2) - 7 freq audition (2) - 8 freq edeitioun (2) - 8 freq editions (2) - 4 freq naition (3) - 1 freq edeitions (3) - 3 freq evitin (3) - 4 freq elation (3) - 3 freq dotin (3) - 2 freq datin (3) - 11 freq diction (3) - 9 freq editing (3) - 3 freq edication (3) - 3 freq addition (3) - 17 freq mediation (3) - 4 freq tuition (3) - 7 freq editin' (3) - 1 freq editit (3) - 6 freq emotion (3) - 19 freq editiouns (3) - 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 |
EDITION |
| Time to execute Levenshtein function - 0.199635 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.369617 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.027313 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.037528 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.000923 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. |