commit | 189dd28362838fa19da8e2af7d34ada320cbccba | [log] [tgz] |
---|---|---|
author | Xin Li <delphij@google.com> | Sat Feb 20 00:24:14 2021 -0800 |
committer | Xin Li <delphij@google.com> | Sat Feb 20 00:24:14 2021 -0800 |
tree | 813cb5a8698e532a410c1e2eca4fcdd94df1ff81 | |
parent | f091fdc072257e0124e6aa39aac4736828c6e599 [diff] | |
parent | c9570b2a213b95b52cebe69e408727a04e5f8fd9 [diff] |
Mark ab/7061308 as merged in stage. Bug: 180401296 Merged-In: Idfe5f25234cd6e6bd641d912524681304fa08752 Change-Id: I3f94a2234374a075814fe3d79510d53726476ecb
marisa-trie
MARISA: Matching Algorithm with Recursively Implemented StorAge
0.2.6
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 |
You can get the latest version via git clone
. Then, you can generate a configure
script via autoreconf -i
. After that, you can build and install libmarisa and its command line tools via configure
and make
. For details, see also documentation in docs
.
$ git clone https://github.com/s-yata/marisa-trie.git $ cd marisa-trie $ autoreconf -i $ ./configure --enable-native-code $ make $ make install