存储字符串 meaning in Chinese

store string

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模式匹配和有限自动机匹配的思想。

More: Prev