Diogenes is a tool for searching and browsing the Latin and ancient Greek texts published on CD-ROM by the Packard Humanities Institute and the Thesaurus Linguae Graecae. It comes as an easy-to-install stand-alone application for GNU/Linux, Mac OS X, and Windows, based on the Firefox browser (i.e. Xulrunner). Alternatively, it can be installed by a network administrator as a server on a local network, and users then access it via an ordinary Web browser. There is also a command-line tool which can optionally format output as LaTeX instead of HTML.
Linguaphile is a simple command line language translator. It is open source, platform independent, and programmed in Perl. Linguaphile currently supports the following languages: Afrikaans, Alawa, Albanian, Arrernte, Basque, Belarusian, Bulgarian, Catalan, Croatian, Czech, Danish, Dutch, English, Esperanto, Estonian, Finnish, French, Galician, German, Greek, Hawaiian, Hungarian, Icelandic, Indonesian, Interlingua, Irish, Italian, Kala Lagaw Ya, Korean, Kriol, Latvian, Lithuanian, Malay, Maltese, Maori, Norwegian, Pitjantjatjara, Polish, Portuguese, Romanian, Russian, Samoan, Serbian, Slovak, Slovenian, Spanish, Swahili, Swedish, Thai, Tok Pisin, Turkish, Ukrainian, Warlpiri, and Welsh. The Spanish to English translation is the most useful at this stage.
Name::Find Perl Module is a Perl module for finding names in a text string. It doesn't look for a particular name, but variations of names in the form: Honorific, GivenName1, GivenName2, Surname, Suffix (where some parts may not exist, and GivenName1 and 2 may be initials). It uses a dictionary based approach, so names not in the dictionary will not be found. There is a separate dictionary for each of the word positions in the name, so you don't have to have a list of every possible name combination.
The GCC XML Tree Node Introspector project consists of a patch to the gcc compiler to output the internal compiler tree nodes in RDF/XML and programs to process that RDF/XML. The tree nodes are complex data structures which represent the source code inside the compiler. Through these tree nodes, users are able to extract information from their programs that would be otherwise very difficult to obtain. Modules exist to store these nodes in Redland RDF using a Berkley database. The long-term goal of the project is create a high-level API that will make the programmatic manipulation of programs easier than it is now.
Respell converts English text between the American, British, and Canadian spelling conventions. It prompts the user for cases where more than one target spelling could be chosen for a source word. It can also create a 'universal' spelling which can be automatically converted to any of the three without loss of information.
Marko is a simple toolset that allows you to create markov chain databases of a corpus (or two) of text and then allows you to compare unknown texts to these databases. For any two marko databases you can calculate the probability that the unknown body is related to one over the other. Possible applications include intelligent mail filtering, plagiarism detection, and historical research.