摘要
介绍了迪杰斯特拉(Dijkstra)算法的定义、思想和步骤。将一个藏语句子构成一个"线性"图,通过图中的算法实现藏语句子的分词操作。将典型图的非线性结构变成特殊的线性结构,并且通过辅助结点将图特殊化,最后再还原。实践证明,使用本方法能巧妙地使用Dijkstra算法来实现分词操作。
Dijkstra is a classic algorithm to calculate the shortest path of two points in map of data structure.In this article a Tibetan sentence was created as a map（each vertex of the map is a word of a Tibetan sentence,so the shape of the map is like a link）,so if we calculate the shortest path between the first word and the last word,we finish the word-split.Think about that there is no connection between each word,so that we can not accomplish a sentence＇s word-split.We can add an edge between two words,and add an assist node at the end of the map,and the in-degree of one vertex becomes the next vertex＇s in-degree,and reduces it after accomplishing word-split.
出处
《数字通信》
2012年第6期38-40,共3页
Digital Communications and Networks
