Soothsayer is an intelligent predictive text entry platform. Soothsayer
exploits redundant information embedded in natural languages to generate
predictions. Soothsayer's modular and pluggable architecture allows its
language model to be extended and customized to utilize statistical,
syntactic, and semantic information sources.
A predictive text entry system attempts to improve ease and speed of
textual input. Word prediction consists in computing which word tokens
or word completions are most likely to be entered next. The system
analyses the text already entered and combines the information thus
extracted with other information sources to calculate a set of most
probable tokens.
Popup is an interactive learning aid for pairs of words. It behaves much like
a stack of flashcards, but handles one-to-many and many-to-one word
relationships better, and includes an integrated scheduler for efficient use
of your 'cards'. Popup was written by Bjorn Ghola and Rob Burns.
Features:
* An editor for cardstack files with support for copying and pasting groups
of words, as well as drag and drop.
* Three quiz styles: multiple choice, spelling, and flashcard.
* Supports quizes and practice
* Graduated time interval scheduler.
* Localized for Thai and German.
LICENSE: GPL2 or later
Utilities for the documentation of Python modules.
PyEnchant is a set of language bindings and some wrapper classes to make
the excellent Enchant spellchecker available as a Python module.
The bindings are generated using SWIG. It includes all the functionality
of Enchant with the flexibility of Python and a nice 'Pythonic'
object-oriented interface. It also aims to provide some higher-level
functionality than is available in the C API.
Libtre is an attempt to create a lightweight, robust, and efficient fully
POSIX compliant regexp matching library. There is still some work left, but
the results so far are promising.
At the core of Libtre is a new algorithm for regular expression matching with
submatch addressing. The algorithm uses linear worst-case time in the length
of the text being searched, and quadratic worst-case time in the length of the
used regular expression. In other words, the time complexity of the algorithm
is O(M2N), where M is the length of the regular expression and N is the length
of the text. The used space is also quadratic on the length of the regex, but
does not depend on the searched string. This quadratic behaviour occurs only
on pathological cases which are probably very rare in practice.
Pure python bindings for Augeas
pyXLWriter is a Python library for generating Excel-compatible spreadsheets.
It's a port of John McNamara's Perl Spreadsheet::WriteExcel module (see
http://www.cpan.org) to Python.
Aspell Quechua dictionary.
RapidXml is an attempt to create the fastest XML parser possible,
while retaining useability, portability and reasonable W3C
compatibility. It is an in-situ parser written in modern C++, with
parsing speed approaching that of strlen function executed on the
same data.
RapidXml has been around since 2006, and is being used by lots of
people. HTC uses it in some of its mobile phones.
If you are looking for a stable and fast parser, look no further.
Integration with your project will be trivial, because entire library
is contained in a single header file, and requires no building or
configuration.
Aspell Romanian dictionary.
Note: if you build from ports, prefer textproc/aspell, it will let you
select dictionaries for several languages.