点击次数：

论文类型：会议论文

发表时间：2009-11-30

收录刊物：EI、CPCI-S、Scopus

卷号：1

页面范围：438-+

关键字：classics of tea; segmentation; tree-pruning

摘要：Automatic word-segmentation is vital for the reading, comprehension and translation of classics. However, large amount of special terms, allusions and proper names within the classics make it difficult for word segmentation. Taking classics of tea as the subject of research, a method was proposed using likelihood ratio statistics to decide two-character words candidate, three-character words candidates and multi-character words candidates, and then segment classics of tea automatically by tree-pruning algorithm. The computation complexity of the tree-pruning algorithm is O (LN), L is number of the Chinese characters of the longest word. Experiments show it has better results in word-segmentation.