Ports Search

Results 331340 of 1,719 for /textproc/.(0.004 seconds)
textproc/libstree-0.4.2 (Score: 0.068937615)
Generic Suffix Tree Library
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)).
textproc/info2html-2.0 (Score: 0.068937615)
Translate GNU info files into HTML pages
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.
textproc/doublemetaphone-1.0.1 (Score: 0.068937615)
PECL extension which implements the Double Metaphone algorithm
The doublemetaphone extension provides an implementation of the Double Metaphone algorithm.
textproc/info_to_html-0.9.6 (Score: 0.068937615)
Translate GNU info files into HTML pages
Translate GNU info files into HTML pages
textproc/enchant-1.1.0 (Score: 0.068937615)
Libenchant Binder that Support Near All Spelling Tools
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)
textproc/is-aspell-0.51.1.0 (Score: 0.068937615)
Aspell Icelandic dictionary
Aspell Icelandic dictionary.
textproc/libtre-0.8.0 (Score: 0.068937615)
Lightweight fully POSIX compliant regexp matching library
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.
textproc/html_parse-1.0.0 (Score: 0.068937615)
PECL extension for the ekhtml library
A PECL HTML parser extension based on the ekhtml library
textproc/hyphen-2004.04.15 (Score: 0.068937615)
Icelandic hyphenation rules
Icelandic hyphenation rules
textproc/iso-schematron-xslt-20130313 (Score: 0.068937615)
The Leading Implementation of ISO Schematron
This is Rick Jelliffe's implementation of ISO Schematron using XSLT.