Ports Search

Results 14,69114,700 of 17,773 for comment.zh_CN%3A%E6%8E%A7%E5%88%B6%E5%8F%B0.(0.03 seconds)
textproc/RDF-Core-0.51 (Score: 1.3217685E-4)
Object oriented Perl modules for handling tasks related to RDF
RDF::Core is a pure perl implementation of RDF storage, parser, serializer and query. The storage functionality is basic - store, delete, query statements, where query means ask about existence or count or retrieve statements conforming given mask of (subject, predicate, object). Three storages are available - in memory, file (DB_File) and DBMS (PostgreSQL). The parser supports full RDF/XML syntax including aboutEach attribute (though it became obsolete). The serializer attempts to preserve anonymous nodes and to compact xml a bit grouping statements with common subject. The query language is rather focused on resources than on statements.
textproc/Text-Diff-HTML-0.07 (Score: 1.3217685E-4)
Text::Diff::HTML - XHTML format for Text::Diff::Unified
This class subclasses Text::Diff::Unified, a formatting class provided by the Text::Diff module, to add XHTML markup to the unified diff format. For details on the interface of the diff() function, see the Text::Diff documentation. In the XHTML formatted by this module, the contents of the diff returned by diff() are wrapped in a <div> element, as is each hunk of the diff. Within each hunk, all content is properly HTML encoded using HTML::Entities, and the various sections of the diff are marked up with the appropriate XHTML elements.
textproc/Tree-Nary-1.30 (Score: 1.3217685E-4)
Perl implementation of N-ary search trees
The Tree::Nary class implements N-ary trees (trees of data with any number of branches), providing the organizational structure for a tree (collection) of any number of nodes, but knowing nothing about the specific type of node used. It can be used to display hierarchical database entries in an internal application (the NIS netgroup file is an example of such a database). It offers the capability to select nodes on the tree, and attachment points for nodes on the tree. Each attachment point can support multiple child nodes.
textproc/XML-Parser-Lite-0.721 (Score: 1.3217685E-4)
Lightweight regexp-based XML parser
This Perl module implements an XML parser with a interface similar to XML::Parser. Though not all callbacks are supported, you should be able to use it in the same way you use XML::Parser. Due to using experimental regexp features it'll work only on Perl 5.6 and above and may behave differently on different platforms. Note that you cannot use regular expressions or split in callbacks. This is due to a limitation of perl's regular expression implementation (which is not re-entrant).
textproc/XML-RSS-SimpleGen-11.11 (Score: 1.3217685E-4)
For writing RSS files
This module is for writing RSS files, simply. It transparently handles all the unpleasant details of RSS, like proper XML escaping, and also has a good number of Do-What-I-Mean features, like not changing the modtime on a written-out RSS file if the file content hasn't changed, and like automatically removing any HTML tags from content you might pass in. This module isn't meant to have the full expressive power of RSS; instead, it provides functions that are most commonly needed by RSS-writing programs.
textproc/soothsayer-0.6.3 (Score: 1.3217685E-4)
Intelligent predictive text entry platform
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.
textproc/rapidxml-1.13 (Score: 1.3217685E-4)
Fast C++ library for parsing XML
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.
textproc/rarian-0.8.1 (Score: 1.3217685E-4)
OMF help system based on the Freedesktop specification
Rarian is designed to be a replacement for scrollkeeper. It is currently undergoing heavy development. As of writing, rarian can be installed in place of scrollkeeper and everything will work okay. Rarian manages documentation metadata (as specified by the Open Source Metadata Framework (OMF) and provides a simple API to allow help browsers to find, sort, and search the document catalog. It will also be able to communicate with catalog servers on the Net to search for documents which are not on the local system.
textproc/WordNet-3.0 (Score: 1.3217685E-4)
Dictionaries and thesauri with devel. libraries (C, TCL) and browsers
WordNet is a powerful lexical reference system that combines aspects of dictionaries and thesauri with current psycholinguistic theories of human lexical memory. It is produced by the Cognitive Science Laboratory at Princeton University, under the direction of Professor George Miller. In WordNet, words are defined and grouped into various related sets of synonyms. Not only is the system valuable to the casual user as a powerful thesaurus and dictionary, but also to the researcher as one of the few freely available, lexical databases. WordNet is available via an on-line interface and also as easy-to-compile C source code for Unix.
textproc/tokyodystopia-0.9.15 (Score: 1.3217685E-4)
Full-text search system based on Tokyo Cabinet
Tokyo Dystopia is a full-text search system. You can search lots of records for some records including specified patterns. The characteristic of Tokyo Dystopia is the following. * High performance of search * High scalability of target documents * Perfect recall ratio by character N-gram method * Phrase matching, prefix matching, suffix matching, and token matching * Multilingualism with Unicode * Layered Architecture of APIs Tokyo Dystopia is available on platforms which have API conforming to C99 and POSIX. Tokyo Dystopia is a free software licensed under the GNU Lesser General Public License.