搜索资源列表
1
- 自动对文本进行分词，用正向最大逆向最大匹配法结合进行。-Automatic word segmentation of the text, with the maximum reverse maximum matching method combined with.
maxmatch
- 通过对词库进行降序排序，提出窗口的思想，按正向最大匹配的方式进行分词，实现了长词优先。-By thesaurus descending order, proposed the idea of the window, according to the way forward maximum matching word, to achieve a long-term priority.
MyChineseSeg
- 自然语言处理 C# 汉语分词软件 基于正向最大匹配算法并基于一定规则-Natural language processing C# Chinese word segmentation software is based on forward maximum matching algorithm based on certain rules
maxmatch
- 解决最大匹配问题的程序，经过调试，运行正常，并附上测试程序-Maximum matching problem solving process, after commissioning, operating normally, along with test procedures
Bipartite-graph
- 使用matlab编程，讨论二分图的最大匹配和最优匹配-Using matlab programming, discussing the maximum bipartite matching and optimal matching
ten-algorithm
- 目录 1，搜索算法； 2，贪心算法； 3，动态规划； 4，最短路径； 5，最小生成树； 6，二分图的最大匹配； 7，-Contents 1, the search algorithm 2, the greedy algorithm 3, dynamic programming 4, the shortest path 5, the minimum spanning tree 6, maximum bipartite matching 7, ...
GP
- 一个简单的中文分词系统，基于正向最大匹配算法和逆向最大匹配算法。-A simple Chinese word segmentation system, based on the forward and reverse maximum matching algorithm maximum matching algorithm.
FMM_RMM
- 中文分词 以及词性标注，在awt界面上将中文分词,用的是最大正向匹配以及反向最大匹配-Chinese word segmentation and tagging, the interface will be in awt Chinese word segmentation, matching with the maximum forward and reverse maximum matching
MyWordSpliter
- 正向最大匹配算法的实现以及反向最大匹配算法-Forward maximum matching algorithm
1469
- poj 1469 COURSES二分图的最大匹配问题 -poj 1469 COURSES largest bipartite graph matching problem
2771
- poj 2771一道关于二分图的最大匹配-poj 2771 on the maximum bipartite graph matching
AnyMap_Match
- 任意图的最大匹配算法，值得一学。毕竟各位不是只要会会匈牙利算法的那种人吧？-arbitrary map of the maximum matching algorithm, it is worth a study. After all, you would not say that the kind of Hungary algorithm people? Ha ha
split_words
- 分词程序，正向最大匹配法，JAVA语言。核心思想是从句子最左端开始，单字节扫描匹配，直至句末-Segmentation procedure, forward maximum matching, JAVA language. Core idea is to start from the leftmost sentence, single-byte scan match until end of the sentence
kmMatch
- KM算法，实现二分图的最优匹配。可实现最大匹配或者最小匹配。-KM algorithm, bipartite graph to achieve the optimal match. Can achieve maximum or minimum match to match.
MaxMatching
- 寻找两个已知二项图之间的最大匹配, 用图的邻接表表示, 组合数学作业-Two diagrams to find the best match between
fasta
- DNA比对中FASTA算法的简单实现，通过建立查找表、位移表和位移向量表来得出两条序列的最大匹配位移。-DNA matching the FASTA algorithm is simple to achieve, through the establishment of a lookup table, displacement and the displacement vector table to derive maximum matching two sequences displaceme
uva-10349
- 二部图的最大匹配问题，先构建二部图，然后用匈牙利算法求出最大匹配-The maximum bipartite graph matching problem, first build a bipartite graph, and then use the Hungarian algorithm to derive maximum matching
CnFenci
- 基于字典的分词，采用正向最大匹配和反向最小匹配相结合。-Based on a dictionary word, using the forward and reverse maximum matching minimum matching combined.
Hopcroft-Karp
- 复杂网络中寻找最大匹配的Hopcroft-Karp算法的java实现代码，希望对大家有用-Complex networks looking for the biggest match of Hopcroft-Karp algorithm to achieve the java code, we hope to be useful
Hopcroft-Karp
- 复杂网络中寻找最大匹配的Hopcroft-Karp算法的java实现代码，希望对大家有用.-Complex networks looking for the biggest match of Hopcroft-Karp algorithm to achieve the java code, we hope to be useful