Location:
Search - 最大匹配
Search list
Description: 中文分词正反向最大匹配算法
Platform: |
Size: 1810392 |
Author: chengenjin |
Hits:
Description: 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program, flord algorithm matlab procedures, the maximum matching algorithm Hungary (hungary) matlab procedures, minimum spanning tree, prepared by two methods matlab procedures, the minimum cost maximum flow matlab program
Platform: |
Size: 5120 |
Author: 任龙 |
Hits:
Description: 逆向最大匹配切词，很简单，仅供学习...
包含常用的9万的词库。-Reverse Maximum Matching segmentation, very simple, only to learn ... contains 90,000 commonly used in the thesaurus.
Platform: |
Size: 6107136 |
Author: yangwei |
Hits:
Description: 刚上文机器翻译课，自己写的一个简单的正向最大匹配分词-Just above machine translation classes, wrote it myself being a simple maximum matching segmentation
Platform: |
Size: 360448 |
Author: zhangzhitao |
Hits:
Description: 最大匹配分词系统，分词中最见大的，效果也是很好的系统。-maximum matching segmentation
Platform: |
Size: 1024 |
Author: quan |
Hits:
Description: 利用最大匹配法进行分词。需要一个词典。就可以进行分词。性能很好-Carried out using the maximum matching word segmentation. Need a dictionary. Segmentation can be carried out. Good performance
Platform: |
Size: 256000 |
Author: quan |
Hits:
Description: 二分图的最大匹配，非常好的资料。这是我辛勤找来的。-Bipartite graph of maximum matching, very good information. This is what I found the hard.
Platform: |
Size: 8192 |
Author: shixinfei |
Hits:
Description: 这个一个基于逆向最大匹配的分词程序，语料规模比较小。-The maximum matching based on the reverse of the sub-term process, relatively small-scale corpus.
Platform: |
Size: 1517568 |
Author: nancy |
Hits:
Description: 汉语分词 隐马尔科夫模型 最大匹配法 最大概率法-HMM MaxMatch
Platform: |
Size: 1414144 |
Author: 黄舒颖 |
Hits:
Description: 基于hashmap的首字哈希查找法，正向最大匹配法分词系统。代码用c++编写，本系统很好的实现了分词功能。-Based on the first word hash hashmap Find law, being the largest sub-word matching system. Code using c++ development, the system achieved a very good word function.
Platform: |
Size: 3018752 |
Author: 杨小鹏 |
Hits:
Description: 图论中最短路算法，最小生成树，最大匹配与最佳匹配的算法，旅行商问题，求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Fulkerson labeling algorithm
Platform: |
Size: 40960 |
Author: 夏秋 |
Hits:
Description: 正向最大匹配算法分词，采用容器储存字典可提高一定的效率。-Forward Maximum Matching algorithm for word segmentation, using containers for storage dictionaries can improve a certain efficiency.
Platform: |
Size: 1024 |
Author: lan |
Hits:
Description: 有相同个数的黑白点， 当且仅当黑点的x y坐标大于等于白点的x y坐标事，黑点支配白点，一个黑点只能支配一个白点，一个白点只能被一个黑点支配，求最大匹配数-Have the same number of black and white points, if and only if the black spots greater than or equal to xy coordinates of the xy coordinates of white spots something, the black dominates white spots, a black spot can dominate a white point, a white point can only be a black dominates, seeking maximum matching number of
Platform: |
Size: 325632 |
Author: 钟峰 |
Hits:
Description: 对一个字符串进行最大匹配法分词的算法，在VC环境下运行即可。-A string of maximum matching word segmentation algorithm can be run in the VC environment.
Platform: |
Size: 5120 |
Author: yoen |
Hits:
Description: clucene 源码，并且增加了自己写的正向最大匹配算法的分词程序。-clucene source code, and increase their own to write the forward maximum matching algorithm for the sub-word program.
Platform: |
Size: 440320 |
Author: yimi |
Hits:
Description: 分别用最大匹配和最大熵的方法实现了汉语分词-Respectively maximum matching and maximum entropy methods to achieve the Chinese word
Platform: |
Size: 2203648 |
Author: yum056 |
Hits:
Description: 逆向最大匹配算法实现分词，分词结果在另一个txt里呈现(Reverse maximum matching algorithm to achieve the word segmentation, word segmentation results in another TXT presentation)
Platform: |
Size: 12288 |
Author: lanlingzijue
|
Hits:
Description: 用双向最大匹配算法实现汉语分词。准确率颇高。(Two way maximum matching algorithm is used to realize Chinese word segmentation. The rate of accuracy is quite high.)
Platform: |
Size: 1024 |
Author: feng4251 |
Hits:
Description: 求二分图最大匹配可以用最大流或者匈牙利算法。
最大匹配 给定一个二分图G，在G的一个子图M中，M的边集中的任意两条边都不依附于同一个顶点，则称M是一个匹配. 选择这样的边数最大的子集称为图的最大匹配问题 如果一个匹配中，图中的每个顶点都和图中某条边相关联，则称此匹配为完全匹配，也称作完备匹配。(For maximum matching of two partite graphs, maximum flow or Hungarian algorithm can be used.
The maximum match is given a two partite graph G. In a subgraph M of G, any two edges of the edge of the M are not attached to the same vertex, then it is called a match. The subset of the largest number of the edges of the graph is called the maximum matching problem of the graph if each vertex in the graph is associated with a certain edge in the graph. This match is called complete matching, also known as complete matching.)
Platform: |
Size: 1024 |
Author: magician- |
Hits:
Description: 如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
Platform: |
Size: 4096 |
Author: throne1 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
27
»