| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edeitiouns (0) - 1 freq edeitioun (1) - 8 freq edeitions (1) - 3 freq editiouns (1) - 1 freq edeetions (2) - 1 freq editioun (2) - 2 freq editions (2) - 4 freq edeition (2) - 13 freq opeiniouns (3) - 1 freq ambeitiouns (3) - 1 freq naitiouns (3) - 9 freq releigiouns (3) - 2 freq additioun (3) - 1 freq poseitiouns (3) - 1 freq rendeitions (3) - 2 freq staitiouns (3) - 2 freq elections (3) - 47 freq edeetion (3) - 12 freq neitions (3) - 1 freq rendeitioun (3) - 1 freq devotiouns (3) - 1 freq edition (3) - 27 freq deceisiouns (3) - 3 freq exertions (3) - 2 freq questiouns (3) - 1 freq |
edeitiouns (0) - 1 freq edeitions (1) - 3 freq editiouns (1) - 1 freq editions (2) - 4 freq edeitioun (2) - 8 freq edeetions (2) - 1 freq edeition (3) - 13 freq editioun (3) - 2 freq edeetion (4) - 12 freq neitions (4) - 1 freq devotiouns (4) - 1 freq edition (4) - 27 freq auditions (4) - 1 freq naitiouns (4) - 9 freq ections (5) - 13 freq natiouns (5) - 2 freq detours (5) - 1 freq editing (5) - 3 freq editin (5) - 22 freq raitions (5) - 1 freq emotions (5) - 32 freq editors (5) - 24 freq devotions (5) - 4 freq equations (5) - 5 freq adoptions (5) - 2 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 - ETXNS edeitions - 3 freq editions - 4 freq edeitiouns - 1 freq editiouns - 1 freq edeetions - 1 freq |
EDEITIOUNS |
| Time to execute Levenshtein function - 0.256624 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.378374 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.037740 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.044058 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.000887 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. |