jieba

cut(cut_all=false,HMM=true)
1. sentence (split by space or punctuation)
2.load dictionary
3.generate directed acyclic graph
0: [0] 1: [1,2,4] 2: [2] 3: [3,4] 4: [4] 5: [5]

4.find the max weight path bases on word frequency(iterate DAG and find the max weight path of each node)
5.if not a single word,return the word. otherwise store into buffer and finalseg (HMM)