什么是除了克努特 - 莫里斯 - 普拉特,拉宾,卡普和它喜欢的可用字符串匹配算法? [英] What are the available string matching algorithms besides Knuth-Morris-Pratt, Rabin-Karp and likes of it?
问题描述
什么是除了克努特 - 莫里斯 - 普拉特,拉宾,卡普可用的字符串匹配算法,并喜欢?
What are the available string matching algorithms besides Knuth-Morris-Pratt, Rabin-Karp and likes of it?
推荐答案
这些算法的良好引纲要中可以找到:
A well cited compendium of these algorithms can be found in:
<一个href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.133.4896&rep=rep1&type=pdf">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.133.4896&rep=rep1&type=pdf
包括有以下几种算法:
Karp-Rabin
Shift Or
Morris-Pratt
Knuth-Morris-Pratt
Simon
Colussi
Galil-Giancarlo
Apostolico-Crochemore
Not So Naive
Forward Dawg Matching
Boyer-Moore
Turbo-BM
Apostolico-Giancarlo
Reverse Colussi
Horspool
Quick Search
Tuned Boyer-Moore
Zhu-Takaoka
Berry-Ravindran
Smith
Raita
Reverse Factor
Turbo Reverse Factor
Backward Oracle Matching
再加上约15人。
plus about 15 others.
顺便说一句,你可能想澄清,如果你也有兴趣在字符串的相似的算法(如,莱文斯坦距离等),这是密切相关的,如果你真的感兴趣。
BTW, you might want to clarify if you are also interested in string similarity algorithms (e.g., Levenshtein distance, etc), which are closely related, if you are indeed interested in that.
这篇关于什么是除了克努特 - 莫里斯 - 普拉特,拉宾,卡普和它喜欢的可用字符串匹配算法?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!