首页>
外国专利>
THE CHINESE SEGMENTER BASED ON SHORTEST PATH ALGORITHM OF DIRECTED ACYCLIC GRAPH
THE CHINESE SEGMENTER BASED ON SHORTEST PATH ALGORITHM OF DIRECTED ACYCLIC GRAPH
展开▼
机译：基于直接循环图最短路径算法的中文SEGMENTER
展开▼
页面导航
摘要
著录项
相似文献
摘要
PURPOSE: A device for analyzing a Chinese morpheme based on the shortest path algorithm of a directed acyclic graph is provided to use the shortest path algorithm in the directed acyclic graph, thereby extracting an optimized morpheme analyzing result among various analyzing results. CONSTITUTION: Mutual information is extracted by analyzing a corpus and a dictionary. A weighted value is allocated to a pre-registered word according to a word length. Each letter start point is considered as one node about input. A weighted value of a letter is considered as a distance between nodes. A directed acyclic graph is generated. The optimized morpheme among several morpheme analyzing results is analyzed through the shortest path algorithm in the directed acyclic graph.
展开▼
