morris run 中文意思是什麼
morris run
解釋
莫里斯倫-
So a fast pattern matching algorithm on mass string assemble has been proposed to solve the problem of fuzzy matching between a string pattern and a string assemble. to make the algorithm cost - effective in space and time, we have developed an optimized trie - tree structure to store the string assemble and introduced the knuth - morris - pratt ( kmp ) and finite - automata ( fa ) string matching thought to our algorithm. the algorithm has been describled in details and the cost of space and run time has been analized in the thesis
為了實現漢字輸入碼的不完整輸入，解決帶有模糊輸入符的字元串模式與一個字元串集合之間的匹配問題，論文在第三章提出一種海量字元串集合的模式匹配演算法，給出了演算法的具體實現和復雜度分析，並且提出一種優化的檢索樹結構來存儲字元串集合以節省內存空間。為了提高演算法的運行速度，演算法還引入了kmp模式匹配和有限自動機匹配的思想。
分享友人