排序方式： 共有8条查询结果，搜索用时 187 毫秒
1
1.
基于三数组Trie索引树的词典查询机制* 总被引：1，自引：0，他引：1
对双数组Trie进行改进，设计实现基于三数组Trie索引树原理的汉语词典查询机制，并用递归算法实现构词状态表的自动构建。 相似文献
2.
Masao Fuketa Hiroya Kitagawa Takuki Ogawa Kazuhiro Morita Jun-ichi Aoe 《Information processing & management》2014
A trie is one of the data structures for keyword matching. It is used in natural language processing, IP address routing, and so on. It is represented by the matrix form, the link form, the double array, and LOUDS. The double array representation combines retrieval speed of the matrix form with compactness of the list form. LOUDS is a succinct data structure using bit-string. Retrieval speed of LOUDS is not faster than that of the double array, but its space usage is smaller. This paper proposes a compressed version of the double array by dividing the trie into multiple levels and removing the BASE array from the double array. Moreover, a retrieval algorithm and a construction algorithm are proposed. According to the presented experimental results for pseudo and real data sets, the retrieval speed of the presented method is almost the same as the double array, and its space usage is compressed to 66% comparing with LOUDS for a large set of keywords with fixed length. 相似文献
3.
本文介绍了当前几种路由查找算法,并对这几种路由查找算法的复杂度和实际运行性能进行了分析研究。研究表明,虽然二分查找算法在查找性能上没有很大提高,但是在IPv6环境中由于多分支Tire树的查找性能将会有很大的降低,因而二分查找算法的优越性将会得到充分体现。 相似文献
4.
基于三数组Trie索引树的分词系统采用由短词及长词的确定性工作方式,在对汉字串的一遍扫描过程中就能得到结果,避免了整词二分词典查询机制中不必要的多次试探性查询,因而具有较高的处理效率. 相似文献
5.
6.
Tshering C. Dorji El-sayed Atlam Susumu Yata Mahmoud Rokaya Masao Fuketa Kazuhiro Morita Jun-ichi Aoe 《Information processing & management》2010
Minimal Prefix (MP) double array is an efficient data structure for a trie. However, its space efficiency is degraded by the non-compact management of suffixes. This paper presents three methods to compress the MP double array. The first two methods compress the MP double array by accommodating short suffixes inside the leaf nodes, and pruning leaf nodes corresponding to the end marker symbol. These methods achieve size reduction of up to 20%, making insertion and deletion faster at the same time while maintaining the retrieval time of O(1). The third method eliminates empty spaces in the array that holds suffixes, and improves the maximum size reduction further by about 5% at the cost of increased insertion time. Compared to a Ternary Search Tree, the key retrieval of the compressed MP double array is 50% faster and its size is 3–5 times smaller. 相似文献
7.
It is known that users of internet search engines often enter queries with misspellings in one or more search terms. Several web search engines make suggestions for correcting misspelled words, but the methods used are proprietary and unpublished to our knowledge. Here we describe the methodology we have developed to perform spelling correction for the PubMed search engine. Our approach is based on the noisy channel model for spelling correction and makes use of statistics harvested from user logs to estimate the probabilities of different types of edits that lead to misspellings. The unique problems encountered in correcting search engine queries are discussed and our solutions are outlined. 相似文献
8.
1