Compare the words of one or more named files with the system dictionary. Display unrecognized words at the top of the screen, accompanied by possible correct spellings, and allow editing via a series of single-character commands that are case-insensitive.
Back up original file in filename.bak.
Count two correctly spelled words without a space between them as a spelling error.
Count two correctly spelled words without a space between them as a legitimate compound word.
Search file instead of standard dictionary file.
File is in HTML/XML format.
Show number lines of context.
Suggest combinations of known roots and affixes, even if the result is not known. For example, “generous” and “ly” are known, so “generously” would be suggested as a word, even if it were not in the dictionary.
List interactive commands at bottom of screen.
Expect nroff or troff input file.
Suppress printing of interactive commands.
Search file instead of personal dictionary file.
Do not guess new words using known roots and affixes. The opposite of -m.
Sort suggested replacements by likelihood that they are correct.
Expect TEX or LATEX input file.
Expect all files to be formatted by type.
Use hat notation (^L) to display control characters, and M- to display characters with the high bit set.
Consider chars to be legal, in addition to a-z and A-Z.
Never consider words that are n characters or fewer to be misspelled. ...