Changes from 0.1.6
- Rewritten word break routines:
- Split dictionary from source, thus new dependency on libdatrie
- New word break routine from scratch, for maintainability
- Improved dictionary for word segmentation:
- New word list preparation process from multiple categories
- New contemporary words not included in Royal Institute dictionary, as well as some proper names for countries and locations, etc.
This is a bug-fix release of datrie.
About datrie
datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe.
Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
See the details of the implementation at: http://linux.thai.net/~thep/datrie/datrie.html
This is the first release of datrie.
About datrie
datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe.
Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
See the details of the implementation at: http://linux.thai.net/~thep/datrie/datrie.html