LanguageTool is a style and grammar checker that currently supports English, Polish, German, French, Dutch, and other languages to a different degree. It scans the words and their part-of-speech tags for occurrences of error patterns, which are defined in an XML file. More powerful error rules can be written in Java. LanguageTool should be used after the spelling of a text has been corrected.
XML-Grammar-Fiction is a Perl package that provides processors for lightweight markup languages and corresponding XML grammars for writing prose (e.g. stories, novels, and novellas) as well as screenplays. The XML grammars can in turn be translated to XHTML and DocBook/XML. XML-Grammar-Fiction currently offers only very basic functionality, but has good support for UTF-8 and allows one to write bidirectional texts conveniently. It is still under development and may exhibit some quirks.
After the Deadline checks English spelling, misused words, style, and grammar using artificial intelligence and natural language processing. This add-on adds After the Deadline's smart technology to the Firefox browser. Now you can check grammar in your online word processor, spell check your Web mail, and send tweets with confidence.
KeyBoards is a cross-operating system platform that synchronizes short text messages or URLs. It is designed to be used for composing messages on a desktop system with a real, comfortable keyboard, and then sending them to a mobile device for transmission as an SMS. It is ideal for use with non-Latin character sets.
Theorem Linker is a program used to visualize references between theorems in a paper written using LaTeX. Using a .tex document (and a .aux file, created by the LaTeX compiler), Theorem Linker will search through a paper, find theorems, and find references to other theorems within a theorem's "proof". It will then create a digraph in a .dot file (to be opened with programs such as Graphviz or OmniGraffle) that will display each theorem as a node, with directed edges to describe the relations between the theorems. A path highlighted in red describes the longest path in the graph. Theorem Linker will also create folders containing graphs to individually show relations of each theorem in a paper.