搜索资源列表
SF
- 中文分词在中文信息处理中是最最基础的，无论机器翻译亦或信息检索还是其他相关应用，如果涉及中文，都离不开中文分词，因此中文分词具有极高的地位。中文分词入门最简单应该是最大匹配法-Chinese word segmentation in Chinese information processing is the most basic, whether in machine translation Yihuo information retrieval, or other related applic
white_black
- 1、问题描述 设平面上分布着n个白点和n个黑点,每个点用一对坐标(x, y)表示.一个黑点b=(xb,yb)支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw.若黑点b支配白点w,则黑点b和白点w可匹配(可形成一个匹配对).在一个黑点最多只能与一个白点匹配,一个白点最多只能与一个黑点匹配的前提下,求n个白点和n个黑点的最大匹配对数. 2、具体要求 要求:时间效率在O(NlgN) 3、实现方法 基于贪心算法 以x坐标的升序对黑点排序(可用QUIC
Web-Chinese
- 中文自动分词技术是中文 Web信息处理的基础。文中以最大匹配法(MM)为基础 ,充分 考虑上下文(MMC) ,在内存中采用二分法进行分词匹配 ,有效地提高了分词的准确率和时效。-Chinese automatic segmentation technology is Chinese Web information processing foundation. The maximal matching method (MM) as the foundation, fully Conside
Index
- 方便检索匹配等应用的，中文后序最大匹配算法的实现，数据库中词表和停用词自行更改即可-Convenient retrieval matching, Chinese applications such as after the realization of maximal matching algorithm sequences, the database tables and stop words seen to change can
Chinese_wordspliter
- 使用正向最大匹配法的中文分词器 分别读入待分词文本文件及字典文件后，将经处理后的结果输出至另一文件予以保存。所用待分词文件样例约有字符184万个，处理时间在11s左右。程序使用C++语言编写。-Using the forward maximum matching device of Chinese words segmentation, respectively, to be read into the text file and dictionary file, the result will
QingXiHua
- 该算法是关于图像清晰化的算法，里边包含了光流法，块匹配，凸集投影和最大后验概率等，是很好的参考东西。-The algorithm is an algorithm for image clarity, inside includes optical flow, block matching, convex set projection and maximum a posteriori probability, is a good reference for things.
chuanpipei
- 串的最大匹配算法的新思路，课本上讲解的都是KMP算法-Maximum matching algorithm string of new ideas, textbooks are all on the KMP algorithm to explain
hungarian
- 匈牙利算法 求解最大匹配问题 s为最佳匹配的总权值 e(:,[1,2])为匹配的两点，e(:,3)为各匹配的权-Hungarian algorithm to solve the maximum matching problem s is the best match of the total weight e (:, [1,2]) to match the two points, e (:, 3) for the right match
hungary
- 最大匹配 很好的方法 hunary法 -the best matching for the matching map ,the measrue is hunary,the best matching for the matching map ,the measrue is hunary
rotation-template-matching
- 基于互信息的模板匹配算法，最后通过fminsearch函数寻找全局最小值，以此达到互信息最大，可以对旋转的模板进行比较精确的匹配-rotation template matching using correlation of information，this method can get the precise result
Max_match_algorithm
- 前向最大匹配算法，包括对西文字符和中文标点的正确处理，在vs2010下编写-Prior to the maximum matching algorithm, including Western and Chinese punctuation characters in the proper handling, prepared in vs2010
MATLAB-algorithm-and-program-code
- 图论算法及matlab程序代码包含求任两点间最短路径的算法及代码Floyd、kruskal，最大匹配的匈牙利算法，并使用matlab程序实现。-Graph algorithms and matlab code includes the algorithm(Floyd, kruskal, maximal matching algorithm of Hungary,) to solve the shortest path between two points, and use matlab prog
WordSegment
- 用C++开发的分词系统 运用基于哈希的逆向最大匹配算法 基于词典-Word in C development system uses a hash-based reverse maximum matching algorithm is based on dictionary
freqci2009
- 是一个自动分词软件，采用正向最大匹配法，文档解压后可以直接使用，内附有源代码。-An automatic segmentation software, using the forward maximum matching method, the document can be used directly after decompression included the source code.
Algorithm-template
- C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash metho
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.
chinese-_segmentation
- 中文分词算法介绍，正向最大匹配。word-word for chinese segmentation algrithm
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