搜索资源列表
TireTree
- Trie树,又称字典树、单词查找树,是一种树形结构，用于保存大量的字符串。它的优点是：利用字符串的公共前缀来节约存储空间，是一种比较简单的数据结构。理解起来比较简单,但Trie树也有它的缺点,Trie树的内存消耗非常大。-Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use
trie
- This program implements a (zipped) tree search for information retrieval programs, first you can get a key words and then it will save them in its format. also with a simple change you can pass a file as input and find related document information. i
TireTree
- Trie树,又称字典树、单词查找树,是一种树形结构，用于保存大量的字符串。它的优点是：利用字符串的公共前缀来节约存储空间，是一种比较简单的数据结构。理解起来比较简单,但Trie树也有它的缺点,Trie树的内存消耗非常大。-Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use
PST-v1.0
- 使用隐马尔科夫模型进行词性标注，数据结构为Trie 树，界面简洁直观，算法效率快-Using hidden Markov model tagging, Trie tree data structures, simple and intuitive interface, fast algorithm efficiency
Trie
- 用字典树的方法高效地对英文文章的单词进行词频统计，并输出统计结果（词频由小到大）-To count the word frequency for an english artical efficiently, using the algorithm of trie, and output the statistic result(word frequency from low to high)