Description: Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree
To Search:
- [wordseg] - Forward Maximum Matching Method Based on
- [WordSeg--JAVA] - This procedure being used to achieve rev
- [KSeg4J.1.0] - a simplified Chinese segmentation Jar
- [MainFrm] - The design and implementation of a Chine
File list (Check if you may need any files):
bin\BackwardMatch.class
...\BaseMatch.class
...\dict.txt
...\Dictionary.class
...\ForwardMatch.class
...\FrequencyMatch.class
...\MainFrame$1.class
...\MainFrame$2.class
...\MainFrame$3.class
...\MainFrame.class
...\Word.class
src\BackwardMatch.class
...\BackwardMatch.java
...\BaseMatch.class
...\BaseMatch.java
...\dict.txt
...\Dictionary.class
...\Dictionary.java
...\ForwardMatch.class
...\ForwardMatch.java
...\FrequencyMatch.class
...\FrequencyMatch.java
...\MainFrame$1.class
...\MainFrame$2.class
...\MainFrame$3.class
...\MainFrame$4.class
...\MainFrame.class
...\MainFrame.java
...\Word.class
...\Word.java
.classpath
.project
compile.bat
run.bat
说明.txt
bin
src
Download