libstree is a generic suffix tree implementation, written in C.
It can handle arbitrary data structures as elements of a string.
Unlike most demo implementations, it is not limited to simple ASCII
character strings. Suffix tree generation in libstree is highly
efficient and implemented using the algorithm by Ukkonen, which
means that libstree builds suffix trees in time linear to the length
of the strings (assuming that string element comparisons can be done
in O(1)).
Translate GNU info files into HTML pages, one page per node.
Menus, Notes, and Up/Next/Prev pointers are translated into links.
Other text is left as-is in <PRE></PRE> tags.
The doublemetaphone extension provides an implementation of the Double Metaphone
algorithm.
Translate GNU info files into HTML pages
Enchant is a binder for libenchant. Libenchant
provides a common API for many spell libraries,
such as aspell/pspell(intended to replace
ispell),hspell(hebrew),ispell,myspell/hunspell
(OpenOffice project, mozilla),uspell (primarily
Yiddish, Hebrew, and Eastern European languages)
Aspell Icelandic dictionary.
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.
A PECL HTML parser extension based on the ekhtml library
Icelandic hyphenation rules
This is Rick Jelliffe's implementation of ISO Schematron using XSLT.