commit | d3f09fc9e9b9bf78eec13e1b8dac5b6e4e313454 | [log] [tgz] |
---|---|---|
author | Susumu Yata <susumu.yata@gmail.com> | Fri Mar 18 04:02:44 2016 +0900 |
committer | Susumu Yata <susumu.yata@gmail.com> | Fri Mar 18 04:02:44 2016 +0900 |
tree | 25f7d49445fc8e32aa7ede45fc33d72b66027d28 | |
parent | 92f1bf2a873881cc85c3191f68d5b954c5bf7dcc [diff] |
Add a missing Makefile.
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 |
The BSD 2-clause License The LGPL 2.1 or any later version