Matching Algorithm with Recursively Implemented StorAge (MARISA) is a space-efficient, fairly fast, and static trie data structure. MARISA serves as a dictionary structure, and by definition, it supports exact match lookup, which is the basic operation of dictionary. In addition, MARISA supports reverse lookup, common prefix search, and predictive search.

Thanks to @terrtia for the discovery.

#datastructure #computerscience

🔗 https://www.s-yata.jp/marisa-trie/docs/readme.en.html

Matching Algorithm with Recursively Implemented StorAge (MARISA) is a space-efficient, fairly fast, and static trie data structure. MARISA serves as a dictionary structure, and by definition, it supports exact match lookup, which is the basic operation of dictionary. In addition, MARISA supports reverse lookup, common prefix search, and predictive search.

Thanks to @terrtia for the discovery.

#datastructure #computerscience

🔗 https://www.s-yata.jp/marisa-trie/docs/readme.en.html