搜索资源列表
wordppl
- 本程序采用正向 逆向最大匹配才实现汉字分词-the procedures being used in reverse to get the maximum matching Chinese Word
Chinese-Word-Segment-And-POS-Tagger
- 实现了中文分词和词性标注程序。分词方法采用“三词正向最长匹配”。词性标注使用HMM方法，用Viterbi算法实现。“三词正向最长匹配”保持了“正向最长匹配算法”快速的特点，同时提高了分词的准确性。-Chinese word segmentation and implemented procedures for POS tagging. Segmentation Methods, " the longest three-match positive words." POS tag
ChineseSegment
- VC6.0实现的中文自动分词，包括最大正向匹配和最大逆向匹配切分，可运行-VC6.0 achieve automatic Chinese word segmentation, including the largest positive match and the maximum matching segmentation reverse, can run
FMM
- 刚上文机器翻译课，自己写的一个简单的正向最大匹配分词-Just above machine translation classes, wrote it myself being a simple maximum matching segmentation
keyword-chouqu
- 基于逆向最大匹配算法的分词及基于HMM模型的词性标注系统，包括了未登录词的识别、数据库的添加等内容。（需要手动修改数据库的路径才可以运行）-Reverse Maximum Matching Algorithm Based on the sub-word HMM-based model and part of speech tagging system, including the unknown word identification, such as the contents of the d
11
- 二分图的最大匹配，非常好的资料。这是我辛勤找来的。-Bipartite graph of maximum matching, very good information. This is what I found the hard.
word_split
- 这个一个基于逆向最大匹配的分词程序，语料规模比较小。-The maximum matching based on the reverse of the sub-term process, relatively small-scale corpus.
segment
- 基于n元语法的分词。先训练后，再通过前后向最大匹配初步分词，在通过2元语法来消岐。-Based on the n-gram sub-word. The first training and then through to the maximum matching before and after the initial word, in through a 2-gram to eliminate qi.
bipartite_graph_maximum_matching
- 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm
ChineseWordSegmentation1
- 中文分词-前向最大匹配方法；VS2008环境下实现-Chinese word- the former to the maximum matching method VS2008 environment to achieve
MainFrm
- 是设计并实现一个汉语自动分词系统。在分析了自动分词面临的主要困难和难点的基础上，旨在降低分词难度和提高分词精度，设计并实现了一个基于正向最大匹配的汉语自动分词系统。-The design and implementation of a Chinese word segmentation system. In the analysis of word segmentation and difficulty of the major difficulties facing based on the
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
EasySeg
- 实现中文分词的最大正向匹配算法，提前输入好文本。-Achieve maximum positive Chinese word matching algorithms, a good text input in advance
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
MMSeg
- 中文自动分词系统，java编写，有界面。可以实现正向最大匹配FMM和逆向最大匹配B-Chinese automatic segmentation system, java write, there are interfaces. You can achieve maximum matching FMM forward and reverse maximum matching BMM
hungarian-algorithm
- 用匈牙利算法求求解二分图最大匹配的算法思路-An algorithm for finding the maximum matching of two points graph with Hungarian algorithm