搜索资源列表
kmp Algorithm
- 这是一个关于字符串匹配的kmp算法,程序简单精炼,可以借鉴一下-This is a match on the string of KMP algorithm, a simple refining process, we can draw about
Las Vegas
- 关于字符串匹配的拉斯维加斯算法,有不好的地方请指正-on the Las Vegas string matching algorithm, the bad Hi
zifuchuanpipeisuanfa
- 字符串近似匹配算法,具有实际应用意义-approximate string matching algorithm is practical significance!
kmpEx
- KMP算法是字符串模式匹配算法, 解决DBCS字符集的问题。-KMP algorithm is a string pattern matching algorithms, DBCS characters to solve the problem,.
stringprocess
- 字符串模式匹配,查找子串加以代替,有两种模式匹配算法-string pattern matching, substring search to be replaced, there are two types of pattern matching algorithm
regexp_source
- 一个字符串匹配、查找替换算法的代码,支持各种通配符-a string matching algorithm to search the replacement code, support wildcards
wordmatch
- 一个简单而有效的字符串近似匹配算法,与大家共享-a simple and effective approximate string matching algorithms, and share
dist2
- 字符串匹配的BM算法,完全自己做出来的, 大家可以拿去参考,一切分享-BM string matching algorithm, completely on my own to do it, we can spend reference, all sharing
38.KMP-String-match-algorithm
- KMP 快速模式串匹配查找算法。 与一般的字符串匹配算法不同在于,匹配中某个字符不同时,并不是把指针退回原点,而是从第二个匹配点开始匹配。-KMP fast string match algorithm, difference to common match algorithm is not back to original point when fail in matching letters.
PEX
- 字符串近似匹配PEX算法(又称k+1分片算法),查找出模式串在目标串中所有近似匹配位置。算法中使用了一种多字符串匹配算法MultipleBNDM,代码也已提供。-PEX,String approximately matching
exKMP
- exKMP 一种扩展的KMP字符串匹配算法-exKMP extended KMP string matching algorithm
kmp
- KMP算法是一种改进的字符串匹配算法,KMP算法的关键是利用匹配失败后的信息,尽量减少模式串与主串的匹配次数以达到快速匹配的目的。-KMP algorithm is an improved string matching algorithm, the key KMP algorithm is the use of information after the match fails, try to reduce the pattern s
BMSearch
- BM算法,十分高效的一种字符串匹配算法,比KMP高效-BM Search
StringMatchAll
- 基于KMP算法所撰写的能实现带通配符的字符串匹配算法源代码-err
StringMatchAll
- 基于KMP算法所撰写的能实现带通配符的字符串匹配算法源代码-err
KMP
- 字符串匹配算法KMP的实现:KMP算法避免了指针的回溯,大大节省了前缀字符串重复带来的重复匹配时间-String matching algorithm KMP implementation: KMP algorithm to avoid the pointer backtrack, greatly saving the prefix string to repeat the repeated match time
boyer_moore_algorithm
- 字符串匹配 boyer_mooer 算法(boyer_mooer algorithm for strings match)
ngram模型分词与统计算法
- N-Gram(有时也称为N元模型)是自然语言处理中一个非常重要的概念,通常在NLP中,人们基于一定的语料库,可以利用N-Gram来预计或者评估一个句子是否合理。另外一方面,N-Gram的另外一个作用是用来评估两个字符串之间的差异程度。这是模糊匹配中常用的一种手段。本文将从此开始,进而向读者展示N-Gram在自然语言处理中的各种powerful的应用。(N-Gram (sometimes referred to as N metamode
StringDemo
- 通过kmp算法实现字符串的匹配,时间复杂度第。面试常问问题(The matching of string is realized by KMP algorithm, and the time complexity is the first. Interviewing often asks questions)
Boyer-Moore
- 字符串BM匹配算法,可以尝试利用并行改进算法(The string BM matching algorithm can try to make use of the parallel improvement algorithm)