An Abecedarian Word is a word whose letters are in alphabetical order. Your goal is to write a program that outputs all abecedarian words from a given lexicon.

Rules:

1. Standard Loopholes are forbidden.
2. If a word contains punctuation, diacritical marks, or any characters other than ASCII alphabet characters (A-Za-z), remove the entire word.
3. Words that are abecedarian in ASCII are not necessarily abecedarian for this challenge. For example 'Maddox' shouldn't be considered abecedarian.
4. Your program should work with any lexicon, but for testing purposes, this one can be used. (If my code works properly) It contains 588 587 abecedarian words that follow the above rules. The lexicon does not count towards your byte total. https://gist.githubusercontent.com/wchargin/8927565/raw/d9783627c731268fb2935a731a618aa8e95cf465/words
5. This is code-golf, so the shortest code in bytes wins!