Home | History | Annotate | only in /external/marisa-trie
Up to higher level directory
NameDateSize
aclocal.m420-Sep-201333.8K
Android.mk20-Sep-20132K
android_diff.txt20-Sep-201316.5K
AUTHORS20-Sep-201328
ChangeLog20-Sep-20130
configure20-Sep-2013188K
configure.ac20-Sep-2013889
COPYING20-Sep-20131.4K
depcomp20-Sep-201317.4K
INSTALL20-Sep-20139.3K
install-sh20-Sep-201313.3K
lib/20-Sep-2013
Makefile.am20-Sep-201375
Makefile.in20-Sep-201320.5K
missing20-Sep-201310.9K
MODULE_LICENSE_BSD_LIKE20-Sep-20130
NEWS20-Sep-20130
README20-Sep-20131.5K
README.android20-Sep-2013662
tests/20-Sep-2013
tools/20-Sep-2013
v0_1_5/20-Sep-2013

README

      1 - Project name
      2 
      3 marisa-trie
      4 http://code.google.com/p/marisa-trie/
      5 
      6 - Project summary
      7 
      8 Matching Algorithms with Recursively Implemented StorAge
      9 
     10 - Version
     11 
     12 0.1.4
     13 
     14 - Description
     15 
     16 This project *marisa-trie* provides a C++ library *libmarisa* and command line tools *`marisa-*`* for building and operating nesting patricia tries. The brand-new dictionary structure is designed to be static and space efficient. Also, *marisa-trie* enables not only simple lookups but also prefix searches and predictive searches.
     17 
     18  * Prefix searches are to find keys from prefixes of a given query.
     19  * Predictive searches are to find keys starting with a given query.
     20 
     21 The biggest advantage of *marisa-trie* is that it can build a considerably compact dictionary. See below for the size of dictionaries built with various trie implementations.
     22 
     23  * Input
     24   * Source: enwiki-20110115-all-titles-in-ns0.gz
     25   * Contents: all page titles of English Wikipedia (Jan. 2011)
     26   * Number of keys: 8,279,325
     27   * Total size: 167,223,035 bytes (plain) / 46,344,646 bytes (gzipped)
     28 
     29 || *Implementation* || *Size (bytes)* || *Remarks*                   ||
     30 ||  darts-clone     ||   316,065,792  || Compacted double-array trie ||
     31 ||  tx-trie         ||   107,119,864  || LOUDS-based trie            ||
     32 || *marisa-trie*    ||   *42,688,271* || Nesting patricia trie       ||
     33 
     34  * Documentation (in Japanese)
     35   * HowTo
     36   * ListOfTools
     37   * LibraryInterface
     38   * BenchmarkResults
     39 
     40 - Version control system
     41 
     42 Subversion
     43 
     44 - Source code license
     45 
     46 New BSD License
     47 
     48 - Project labels
     49 
     50 Nesting
     51 Patricia
     52 Trie
     53 Static
     54 Dictionary
     55 CPlusPlus
     56

README.android

      1 URL: http://marisa-trie.googlecode.com/files/marisa-0.1.4.tar.gz
      2 Version: 0.1.4
      3 License: New BSD
      4 License File: LICENSE
      5 
      6 Description:
      7 C++ library providing implementation of Matching
      8 Algorithm with Recursively Implemented StorAge (MARISA) -- static and
      9 space-efficient trie data structure.
     10 
     11 
     12 Homepage: http://code.google.com/p/marisa-trie/
     13 
     14 Local Modifications:
     15 - Remove files under vs2008/ as we don't need to build under
     16   visual studio.
     17 - Changes to string.h to avoid a header collision with the C
     18   standard header with the same name.
     19 - Apply patch 30551945 from alexgru to fix a critical bug.
     20 - Remove all the exceptions: see <android_diff.txt> for details.
     21