Search - 2-3 tree

Search - 2-3 tree - List

[Other] BottomUpParser DL : 1: （1）可选择不同的规则集（用普通文本文件存贮规则）。（2）利用VC TreeCtrl控件显示分析得到的句法结构树。（3）中间分析过程产生的所有边都输出到结果文件，便于跟踪分析的细节。（4）分析过程中，检索规则集中的规则，查到一条满足条件的规则就停止，因而产生的不是全部分析结果，并且，规则的顺序也会对分析结果有影响（可比较两个规则文件，其中规则内容一样，但有两条规则的顺序不同，在分析 “学习/verb 文件/noun” 这样的例子时结果就不同： -(1) choice of different sets of rules (using ordinary text file storage rules). (2) VC TreeCtrl control analysis showed the syntactic structure of the tree. (3) Intermediate analysis of all the edges are exported to the outcome document, and facilitate the tracking analysis of the details. (4) analysis process, the rules focus on the search rules, found a meet conditions to stop the rules, which not all of the analysis results, and, rules of the order will also have an impact on results of the analysis (which can compare the two rules, which rules the same content, but there are two the sequence of the different rules, the analysis of "learning / verb documents / noun" Such examples on the different results :
Date : 2008-10-13 Size : 52.97kb User : 丁淑彬
[Other] PcfgParser DL : 0: 1. 先打开规则库，读入规则集（可比较两个规则文件rule1.txt 和 rule2.txt的差异） 2. 选择经过分词和词性标注的文件，进行句法分析 3. 分析结果文件与测试文件在同一个目录下，文件后缀名为 .pcfg 4. 分析结束后，同时产生一个新的规则文件,后缀名为.new, 可以观察规则概率值和期望次数的变化 5. 分析结果逐个以树形图方式显示，如果一个句子有多个结果，在显示框中同时显示。-1. Accounting rules to open, read the rules set (comparable two documents rule1.txt rules and the differences rule2.txt) 2. Word selection and tagging of a document for syntactic analysis 3. Results of the analysis and test document with a document in the directory, documents suffixes called. pcfg 4. After the analysis, while generating a new rule, known as the suffix. new, can observe the rules of probability values and expectations of changes in the number of five. results of the analysis-by-tree approach to show that if a sentence is over, the box shows the same time show.
Date : 2008-10-13 Size : 52.01kb User : 丁淑彬
[Other] 综合实验哈夫曼编码 DL : 0: 1．n个叶结点,权分别为w1,w2,• • • ,wn的二叉树中，带权路径长度WPL最小的二叉树叫最优二叉树，也叫霍夫曼树。 2．霍夫曼算法：1）根据给定的权值{w1,w2,• • • ,wn}构造n个二叉树F={T1,T2,• • • ,Tn}每个Ti只有一个根结点，权为wi。2）在F中选取两棵根结点的权值最小的树构成一棵新的二叉树，其根的权值为左右子树根的权值的和。3）F中删去这两棵树，加上新得的树。4）重复2）3）直到只剩一棵树。 -1. N leaf nodes, the right to w1, w2, # 8226 # 8226, wn the binary tree, with the right path length WPL smallest binary tree called Optimal binary tree, the tree is also called Hoffman. 2. Hoffman algorithm : 1) According to the weights (w1, w2, # 8226 # 8226 # 8226, wn) n binary tree structure F = (T1, T2, # 8226 # 8226 # 8226, Tn) each only a Ti Root, the right to wi. 2) In 1984 two F Root in the value of the right to the smallest tree constitute a new binary tree, the roots of the right value for the son around the roots and the value of the right. 3) F deleted these two trees, coupled with the new tree. 4) repeat 2) 3) until only a tree.
Date : 2008-10-13 Size : 1.62kb User : yy
[Other] 二叉树的类实现 DL : 0: 二叉树的一般操作: 1. 判断二叉树是否为空。 2. 搜索二叉树中的某一项。 3. 在二叉树中插入一项。 4. 从二叉树中删除一项。 5. 求二叉树的高度。 6. 求二叉树的节点数量。 7. 求二叉树的叶节点数量。 8. 遍历二叉树。 9. 复制二叉树。 -binary tree : 1. To judge whether the binary tree is empty. 2. Binary Tree Search of a one. 3. The insertion of a binary tree. 4. From a binary tree removed. 5. For binary tree height. 6. For binary tree node number. 7. For binary tree leaf node number. 8. Traverse binary tree. 9. Replication binary tree.
Date : 2008-10-13 Size : 107.47kb User : 刘炎黄
[Other] piaoliang DL : 0: 在二叉搜索树上删除一个有两个子女的结点时，可以采用以下三种方法： (1) 用左子树TL上具有最大关键码的结点X顶替，再递归地删除X。 (2) 交替地用左子树TL上具有最大关键码的结点和右子树TR上具有最小关键码的结点顶替，再递归地删除适当的结点。 (3) 用左子树TL上具有最大关键码的结点或者用右子树TR上具有最小关键码的结点顶替，再递归地删除适当的结点。可随机选择其中一个方案。 -two forks in search of a tree to delete two children nodes, can be used in three ways : (1) to use the left subtree TL on key codes with the greatest of nodes replace X, then X - recursive deleted. (2) to use the turn of the left subtree TL on key codes with the greatest of nodes and right subtrees TR is the smallest key codes node replacement and then recursively to delete the appropriate nodes. (3) The left subtree TL on key codes with the greatest of nodes or use the right subtrees TR is the smallest on the key code top node for further recursion to delete the appropriate nodes. Which can be a random selection program.
Date : 2008-10-13 Size : 1.07kb User : dfssd
[Other] zuixiaoshengchengshu23423 DL : 0: 概要設計 1、程序運\行流程: (1)、提示輸入頂點數目； (2)、接受輸入，按照項目要求產生邊權值的隨機矩陣；然後求解最小生成樹； (3)、輸出最小生成樹並且退出-an outline design, the procedures in process : (1), suggesting that the number of input vertices; (2), accept input, In accordance with requirements of the project have the edge weights random matrix; and then the minimum spanning tree; (3), Output from the minimum spanning tree and
Date : 2008-10-13 Size : 1.45kb User : 丁韦
[Other] careerman DL : 0: 第1题_向量链表功能应用.txt 第2题_双向链表功能应用.TXT 第3题_扩充双向链表的功能.TXT 第4题_二叉树功能应用.TXT 第5题_利用二叉树功能解决实际问题.TXT 第6题_利用二叉树进行四则运算.txt-an article that _ Vector Chain function application. Txt No. 2 _ and that two-way linked list functional applications. TXT No. 3 _ and that the expansion of two-way Chain function. TXT 4 _ that function application binary tree. TXT No. 5 _ and that the use of binary tree functions to solve practical problems. TXT 6 that _ use binary tree for four computing. txt
Date : 2008-10-13 Size : 92.86kb User : 赵文明