Inactive
0
I Use This!

Project Summary

Analyzed about 3 hours ago. based on code collected about 3 hours ago.

Tx is a library for a compact trie data structure. Tx requires 1/4 - 1/10 of the memory usage compared to the previous implementations, and can therefore handle quite a large number of keys (e.g. 1 billion) efficiently. A trie data structure supports exact matching and common prefix matching, which are used for natural language processing etc. Tx uses Level-Order Unary Degree Sequence (LOUDS) for trie representation.

English

Japanese

Share

Activity

30 Day Summary

Aug 4 2015 — Sep 3 2015

12 Month Summary

Sep 3 2014 — Sep 3 2015

Community

Ratings

Be the first to rate this project
 
Click to add your rating
   Spinner f6ecff617ec2ba7f559e6f535cad9b70a3f91120737535dab4d4548a6c83576c
 
Review this Project!