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

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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．