Application Research of the Wildcard Character in theAppoximate Matching.docVIP

Application Research of the Wildcard Character in theAppoximate Matching.doc

  1. 1、本文档共6页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Application Research of the Wildcard Character in theAppoximate Matching.doc

Application Research of the Wildcard Character in theAppoximate Matching   Abstract. The paper first analysises the types and methods of the wildcard characters, then discusses the matching problems which it exists in the pattern matching. According to the problems, it puts forward algorithm to realize approximate matching. At last, it provides the flow charts and examples of the algorithm. From the example of experimental result, exact matchinging can be realized approximate matching through the wildcard characters. So various matching algorithm can be extended and used more.   Key words: wildcard character ;pattern matching ;approximate matching;algorithm   1. Introduction   In everyday life, people encounter two conditions ,one is that we need to find some strings which conformed to particular conditions from a large number of text, two is that we need to confirm the the the strings’ position in the text. In the case, we must use wildcard characters. At present, wildcard characters are widely used in the pattern recognition, text processing, data query, information retrieval, list processing, etc. In the pattern string matching algorithms, such as Brute-Foree algorithm, Knuth-Morris-Pratt[1] algorithm, Boy-er-Moor algorithm[2], and Aho-Corasiek[3] algorithm and so on are exact matchinging algorithm because they are not use wildcard characters in the matching process. Tlthough the exact matchinging algorithms are used wildly, they have som limitations, for example, in some special occasions, people need use the theory of Brute-Foree algorithm to search or modify some special objects. So, in order to widely use all kinds of exact matchinging algorithms, it can consult than exact matchinging algorithms can be improved to approximate matching with wildcard characters. At present, some operating systems and software systems allow using wildcard character in patterns, but the results are not satisfactory, for example, sometime, they bring some errors. Based on

文档评论(0)

guan_son + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档