A wide range of arguments can be given for reversible natural language processing, and the most important ones are summarized in the next subsections. We then present a classification scheme for systems that use reversible grammars, and discuss current approaches to uniform processing of reversible grammars.