搜索资源列表
worddiv
- 中文分词算法，用正向最大匹配算法实现的中文分词，包裹dao操作数据库。-Chinese word segmentation algorithm, the forward maximum matching algorithm of Chinese word segmentation, wrapped dao operations database.
WordSeg
- 此系统是用MFC编写的正向最大匹配的汉语分词系统，代码详尽，经本人调试能运行且正确。-The system is written in MFC forward maximum matching Chinese word segmentation system, a detailed source, I debug run and correct.
WordSeg
- 这是一个分词程序，有正向最大匹配算法，逆向最大匹配算法，正向最小匹配算法。-This is a word segmentation program, there are positive maximal matching algorithm, reverse maximal matching algorithm, positive minimum matching algorithms.
zuidapipei
- 使用匈牙利算法实现二部图最大匹配，最终找到二部图的最大匹配-achieve the max matching in bipartite graph useing the method of Hungarian algorithm
hungrian
- 匈牙利算法的源代码，可以解决二分图的最大匹配问题-Hungarian algorithm source code, can solve the maximum matching problem for bipartite graphs
Rkeyword-choue
- 基于逆向最大匹配算法的分词及基于HMM模型的词性标注系统，包括了未登登录词的识别、数据库的添加等内容。（需要手动修改数据库的路径才可以运行） -Based on the segmentation of the reverse maximum matching algorithm and the HMM-based POS tagging system, including unadvertised login word recognition, and add the database co
xyl_suanfa
- 匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。-Hungarian algorithm is based on the thought of the Hall theorem sufficient proof, it is the Ministry of graph matching most common algorithm, the core of the algorithm is to fi
Hungary
- 二部图的最大匹配的一种算法：匈牙利算法的matlab程序-Two parts graph the maximal matching of a kind of algorithm: Hungary algorithm
MyAnalyzer
- 简单的中文分词及敏感词检索工具，其中可以任意添加敏感词，并且可以选择使用正向最大匹配算法，逆向最大匹配算法，双向最大匹配算法中的一种进行分词。-Simple Chinese word and sensitive word retrieval tool, which can add any sensitive words, and you can choose to use the forward maximum matching algorithm, reverse maximum matchi
hxsfPzdpp
- 核心算法和最大匹配，对于数据结构的学习较有帮助-Core algorithm and the maximum matching, for the data structure of the study more
maximum-matching
- 离散数学，求解图论里的最大匹配，包含两种方法，最大支持100个节点-Discrete mathematics for solving the maximum matching in graph theory, contains two methods, maximum support 100 nodes
Kmp
- 字符串匹配问题，最经典的KMP算法。p为模式串，t为主串。返回的是最大匹配数-String matching problem, the most classic of KMP algorithm. p is the pattern string, t the main string. Back is the maximum number of matches
segment
- 用最大匹配法对汉语进行自动分词 seg.py 分词的实现 accuracy.py 分词性能评估 PD_1998_01_POS.txt ”人民日报“语料库-Automatically the word seg.py segmentation achieve maximum matching of Chinese accuracy.py word performance assessment PD_1998_01_POS.txt " People' s Daily"
ACM.algorithm
- 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms templat
RMM
- 这个是RMM算法，支持正向、逆向最大匹配，是自然语言处理的重要算法之一，只要替代程序中的词库即可。本词库取自1988年人民日报语料材料，算法对中文分词精确度达到90 以上-This is RMM algorithm supports forward, reverse maximum matching, natural language processing algorithm, as long as the alternative procedures thesaurus can. The th
Hungarian(1)
- 有关复杂网络的算法，用于找有向图中的最大匹配，即最大子图的干和环-max match
1
- 自动对文本进行分词，用正向最大逆向最大匹配法结合进行。-Automatic word segmentation of the text, with the maximum reverse maximum matching method combined with.
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