benstadin / marisa-trie

Automatically exported from code.google.com/p/marisa-trie
Other
1 stars 0 forks source link

marisa-trie http://code.google.com/p/marisa-trie/

MARISA: Matching Algorithm with Recursively Implemented StorAge

0.2.4

Matching Algorithm with Recursively Implemented !StorAge (MARISA) is a static and space-efficient trie data structure. And libmarisa is a C++ library to provide an implementation of MARISA. Also, the package of libmarisa contains a set of command line tools for building and operating a MARISA-based dictionary.

A MARISA-based dictionary supports not only lookup but also reverse lookup, common prefix search and predictive search.

The biggest advantage of libmarisa is that its dictionary size is considerably more compact than others. See below for the dictionary size of other implementations.

|| Implementation || Size (bytes) || Remarks || || darts-clone || 376,613,888 || Compacted double-array trie || || tx-trie || 127,727,058 || LOUDS-based trie || || marisa-trie || 50,753,560 || MARISA trie ||

Subversion

The BSD 2-clause License The LGPL 2.1 or any later version

Patricia Trie Static Dictionary CPlusPlus