//正向最大匹配分詞算法 ,耗時長,這並不是一個很好的算法,我的這個輸出是逆向輸入的 using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace ClusterCharater { public class SplitChineseCharacter { private String[] dictionary = { "今天", "是","星期" ,"六","星期六" }; //詞典 private String input = null; public List<String> Reslut = new List<string>(); public SplitChineseCharacter(String input) { this.input = input; } public void start() { String temp = null; for (int i = 0; i < this.input.Length; i++) { temp = this.input.Substring(i); // 每次從字符串的首部截取一個字,並存到temp中 // 如果該詞在字典中, 則刪除該詞並在原始字符串中截取該詞 if (this.isInDictionary(temp)) { Reslut.Add(temp); this.input = this.input.Replace(temp, ""); i = -1; // i=-1是因爲要重新查找, 而要先執行循環中的i++ } } // 當前循環完畢,詞的末尾截去一個字,繼續循環, 直到詞變爲空 if (null != this.input && !"".Equals(this.input)) { this.input = this.input.Substring(0, this.input.Length - 1); this.start(); } } //判斷當前詞是否在字典中 public Boolean isInDictionary(String temp) { for (int i = 0; i < this.dictionary.Length; i++) { if (temp.Equals(this.dictionary[i])) { return true; } } return false; } } } using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Windows.Forms; namespace ClusterCharater { public partial class Form1 : Form { public Form1() { InitializeComponent(); }
private void button1_Click(object sender, EventArgs e)
{
String s=inputtext.Text.Trim();
SplitChineseCharacter scc = new SplitChineseCharacter(s);
scc.start();
foreach (String ss in scc.Reslut)
{
output.Text += ss+"/";
}
}
}
}