compellation recognition

This thesis puts forward two kinds of arithmetic resolving the problem about compellation recognition in automatic division of Japanese. One is based on the rule and the other is based on the combination of the rule and the statistics.
本文提出了基于規(guī)則及基于規(guī)則與統(tǒng)計(jì)相結(jié)合兩種解決日文自動(dòng)分詞中姓名識(shí)別問題的算法，并具體應(yīng)用于實(shí)踐，最終確定基于規(guī)則與統(tǒng)計(jì)相結(jié)合的日文姓名識(shí)別算法可實(shí)現(xiàn)較高的精確率和召回率，并具有較大的靈活性。