期刊文献+

打字比赛系统中字符串匹配算法 被引量:2

String Matching Algorithm in the Program of Typing Match
下载PDF
导出
摘要 打字比赛程序,是学校为了加强学生对计算机基本技能的掌握,而开发的一款用于检验打字速度、准确率等多项指标的比赛程序.传统的字符串匹配算法是基于关键词的匹配算法,只能得到位置信息,而比赛程序是两个大文本之间进行匹配,需要获得更加详细的匹配信息,这时传统算法就无法满足要求.通过对实际问题的探索和研究,在传统算法的基础上,设计出一种新的匹配算法.这种算法可以进行两个文本之间的匹配,得到正确的内容、错误的内容等信息.应用这一算法编写软件,验证了算法的可行性和实用性. The program of typing match is a game program which used to test many indicators of typing, like speed, accuracy and so on. Many schools use it to strengthen students mastery of basic computer skills. The traditional algorithm is based on the keywords matching algorithm, only can get the location information, but the game program is the program of matching between two large text segment, it need get more matching information, so the traditional algorithm is unable to meet the requirement. On the basis of traditional algorithm, a new matching algorithm was designed by the exploration and research of the practical problems. This algorithm can match between the two text, and get the correct content, the error content and other information. So wrote a software in this algorithm, proved the feasibility and practicality of this algorithm.
作者 李载源
出处 《计算机系统应用》 2014年第2期150-154,共5页 Computer Systems & Applications
关键词 打字比赛 关键词 大文本 字符串匹配 算法 typing match key words large text segment string matching algorithm
  • 相关文献

参考文献10

二级参考文献26

  • 1[1]Sellers, P.. The theory and computation of evolutionary distance: pattern recognition. Journal of Algorithms[J], 1980,1:359-373.
  • 2[2]Baeza-Yates, R.A.,Gonnet, G.H.: A new approach to text searching, Communications of the ACM[J]. 35(10):74-82.
  • 3[3]Wu, S., Manber, U.. Fast text searching allowing errors, Communications of the ACM[J]. 35(10):83-91.
  • 4[4]Baeza-Yates, R.A., Navarro, G.. Faster approximate string matching. Algorithmica[J], 23(2):1999,127-158.
  • 5[5]Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM[J], 46(3):1999,395-415.
  • 6[6]Chang, W., Marr, T.. Approximate string matching and local similarity[A]. In: Proc. 5th Combinational Pattern Matching (CPM94) [C], LNCS 807, pages 1994,259-271.
  • 7[7]Navarro, G., Baeza-Yates, R.A.. Very fast and simple approximate string matching. Information Processing Letters[J], 1999,72:65-70.
  • 8[8]Navarro, G., Raffinot, M.. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA) [J], 2000,5(4).
  • 9[9]Sutinen, E., Tarhio, J.. On using q-gram locations in approximate string matching[A]. In: Proc. European Symposium on Algorithms (ESA95) [C], LNCS 979, 1995,327-340.
  • 10[10]Tarhio, J., Ukkonen, E.. Approximate Boyer-Moore string matching. SIAM Journal on computing[J], 1993,22(2):243-260.

共引文献92

同被引文献4

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部