ssct is a command-line utility, humble of intent, that takes a single word, spell checks it, takes the result(s) and then translates them. It works to/from english only. From/to languages are limited by ispell in the first instance, and by the IDP (Internet Dictionary Project) files in the second. Currently the latter includes Spanish, Portuguese (minimal), Latin, German, French and Italian. These files are included with this package. This utility was originally created to make it easier to decode badly-scrawled postcards from Spain.
This is a comprehensive "word game" word list for UNIX/Linux. It is a superset of the author's ENABLE list, the "OSW", and various lists researched by the author's colleague, Alan Beale. At 264,093 words, it is the largest list of its kind, suitable for use in all manners of crossword-type board games and word construction games, as well as for a spell checker dictionary. The YAWL package now includes two anagramming utilities (supplied as source code, handled by the included Makefile). There is also a shell script that extends the UNIX "strings" system command. This is the word list package recommended for the author's Quackey word game.
Emdros is a corpus query system for storing and searching linguistically annotated text. It is very generic, supporting almost any kind of annotation from almost any linguistic theory. All linguistic levels of analysis are supported, including phonology, morphology, the lexical level, syntax, and discourse. The core libraries act as a middleware layer between a client and an underlying SQL database. MySQL, PostgreSQL, and SQLite are supported.
FramerD is a semi-structured object database integrated with a Scheme-based scripting language which supports multi-lingual programming (with pervasive Unicode), a stable module system for programming in the large, distributed applications (via an extensible RPC protocol), non-deterministic (PROLOG-like) evaluation for search and set operations, multi-threaded program execution, extensive tools for text and language analysis, built-in HTML/XML/MIME parsers, and intuitive (CGI- and FastCGI-based) Web scripting. The built-in object database robustly supports millions of objects and indexed access to those objects, both through disk files and networked servers.
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.
kdrill helps people learn Japanese 'Kanji' characters. Its includes a multiple-choice Kanji quiz program that helps people learn Japanese characters with different guess formats and history options. It also has a suite of dictionary lookup functions. Words can be found using a variety of methods including Romaji, SKIP, four-corner, cut-n-paste, radical lookup, and English search.
Connexor Machinese analyzers process sequences of written words, identify and classify the various entities in them, and show how these relate to each other, marking the language with a simple and systematic notation. Currently, the Machinese product family includes: Machinese Phrase Tagger, a fast, light-weight morphosyntactic tagger; Machinese Syntax, a full-scale dependency parser; Machinese Semantics, a dependency parser with semantic analysis; and Machinese Metadata, an entity extractor.