基于字符块跳转技术的藏文字符串匹配算法  

Tibetan string matching algorithm based on character block jump technology

作　　者：周磊超 彭展 ZHOU Leichao;PENG Zhan(School of Information Engineering,Xizang Minzu University,Xianyang 712082,Shaanxi,China;Xizang Cyberspace Governace Research Base,Xianyang 712082,Shaanxi,China;Key Laboratory of Optical Information Processing and Visualization Technology of Tibet Autonomous Region,Xianyang 712082,Shaanxi,China)

机构地区：[1]西藏民族大学信息工程学院,陕西咸阳712082 [2]西藏网络空间治理研究基地,陕西咸阳712082 [3]西藏自治区光信息处理与可视化技术重点实验室,陕西咸阳712082

出　　处：《智能计算机与应用》2024年第12期90-95,共6页Intelligent Computer and Applications

基　　金：西藏自治区自然科学基金(XZ202101ZR0089G)。

摘　　要：字符串匹配算法要求在文本串中查找模式串的出现位置。现有的字符串匹配算法大多针对ASCII字符集,由于藏文结构的特点,若将已有的字符串匹配算法直接应用于藏文上,则会导致其效率出现一定程度的下降。本文分析目前几种较快的字符串匹配算法和藏文结构特点后,提出了一种基于字符块跳转技术的藏文字符串匹配算法-BMH2T算法。BMH2T算法的核心思想是“先跳转,后匹配”,该算法根据文本串中双字符块在模式串的出现位置进行跳转,提高了算法效率。实验结果表明,在处理藏文时,该算法相较于对比算法快约20%~50%,具有更好的性能。The string matching algorithm requires the position of the pattern string in the text string.The existing string matching algorithms are mostly for ASCII character sets.Due to the characteristics of the Tibetan structure,if the existing string matching algorithm is directly applied to Tibetan,there is a certain degree of reduction in its efficiency.This article analyzes several faster string algorithms and Tibetan structure characteristics,and proposes a Tibetan string algorithm-BMH2T algorithm based on character block jumping technology.The core idea of the BMH2T algorithm is"jump first,then match".The algorithm jumps according to the position of the mode string in line with the text string,therefore improves the algorithm efficiency.The experimental results show that when dealing with Tibetan,the algorithm is about 20%~50% faster than the comparison algorithm,which has better performance.

关 键 词：藏文处理 双字符块 字符串匹配算法 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]