| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| editor (0) - 70 freq editer (1) - 1 freq editar (1) - 2 freq editors (1) - 24 freq editor' (1) - 2 freq edter (2) - 1 freq heritor (2) - 1 freq edition (2) - 27 freq elixor (2) - 1 freq mediator (2) - 1 freq edith (2) - 18 freq efiter (2) - 1 freq edited (2) - 6 freq editit (2) - 6 freq creditor (2) - 1 freq editin (2) - 22 freq editor's (2) - 4 freq edit (2) - 17 freq ediot (2) - 1 freq editing (3) - 3 freq 'motor (3) - 6 freq efir (3) - 1 freq evite (3) - 12 freq territor (3) - 5 freq evitit (3) - 2 freq |
editor (0) - 70 freq editar (1) - 2 freq editer (1) - 1 freq edter (2) - 1 freq editor' (2) - 2 freq editors (2) - 24 freq detour (3) - 7 freq editin (3) - 22 freq edit (3) - 17 freq auditour (3) - 2 freq deter (3) - 4 freq dotir (3) - 1 freq ediot (3) - 1 freq edith (3) - 18 freq mediator (3) - 1 freq dater (3) - 1 freq editit (3) - 6 freq efiter (3) - 1 freq edited (3) - 6 freq edition (3) - 27 freq dith (4) - 1 freq baitur (4) - 4 freq edgar (4) - 10 freq motor (4) - 164 freq weiter (4) - 1 freq |
SoundEx code - E336 editor - 70 freq editorials - 1 freq editor' - 2 freq editorial - 26 freq editors - 24 freq editorship - 2 freq editors-code-ofpractice - 1 freq editar - 2 freq editor's - 4 freq editorially - 1 freq editer - 1 freq |
MetaPhone code - ETTR editor - 70 freq editor' - 2 freq editar - 2 freq edter - 1 freq editer - 1 freq |
EDITOR |
| Time to execute Levenshtein function - 0.410354 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.928018 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.172004 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.105316 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.001140 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. |