书面汉语全切分算法中的并发检索模型

A Parallel Searching Algorithm Model of Word Omni-segmentation for Written Chinese

文中首先讨论了书面汉语切分研究的问题,然后从一般性研究出发,提出了全切分算法中可能的并发检索。并针对全切分分词算法进行了研究,给出了全切分分词方法算法中的并发检索模型。希望本文对于全切分算法中并发检索模型的讨论,对深入研究书面汉语全切分分词的问题和实现具有实际意义。

Firstly,the problems of word Omni-Segmentation are discussed in this paper. Then,based on the formula study of obtaining the set of omni-segmentation,the Parallel Searching existing generally in the process of word omni-segmentation is pointed out. Furthermore,according to the study on Omni-segmentation,a model of parallel searching in word omni-segmentation algorithm is given. Hopefully,the above discussion is conducive and practical to the deep researches and implementation of word omni-segmentation of Written Chinese.