CAJ | 학술논문

引入连续跳跃查找文本的思想，提出了一种新的单模式精确匹配算法，其最优条件下的时间复杂度为O[n/(m+1)]，新算法的平均时间复杂度分析表明其具有优越的查找性能.对比实验结果显示，新算法的性能优于目前所见的同类算法，特别是在模式较短的情况下，优势更为明显；这一特点非常适合于自然语言文本的检索.
인입련속도약사조문본적사상，제출료일충신적단모식정학필배산법，기최우조건하적시간복잡도위O[n/(m+1)]，신산법적평균시간복잡도분석표명기구유우월적사조성능.대비실험결과현시，신산법적성능우우목전소견적동류산법，특별시재모식교단적정황하，우세경위명현；저일특점비상괄합우자연어언문본적검색.
A faster algorithm was suggested for single pattern matching by utilizing a continuous skip over the text. This idea has high performance because of the large shift on the text. Its best time complexity is O[n/(m＋1)], which is an inspiring research result. This paper also discussed the average time complexity of this suggested algorithm, which demonstrates and proves its high efficiency. The experimental result shows that the algorithm is superior to other algorithms for pattern matching. Especially, when the pattern is small, it is more efficient than other algorithms, which is very practical in natural language text retrieval.