ranking

0 引言 通过训练SVM获取特征向量权重参数，进而对特征进行排序的方法，成为Ranking SVM. 1 中文版介绍 https://blog.csdn.net/clheang/article/details/45767103 2 H. Joachims 提供的Ranking SVM的源码实现 http://www.cs.cornell.edu/people/tj/svm_light/svm_rank.html 3 Ranking SVM 在dlib中的实现 http://dlib.net/ 来源： https://www.cnblogs.com/ghjnwk/p/11317711.html

< ! DOCTYPE html > < html lang = "en" > < head > < meta charset = "utf-8" > < meta name = "viewport" content = "width=device-width, initial-scale=1.0" > < meta http - equiv = "X-UA-Compatible" content = "ie=edge" > < meta name = "viewport" content = "width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1" > < title > 公益积分榜 < / title > < script src = "https://cdn.suoluomei.com/common/js/jquery-2.1.4.min.js" > < / script > < style > body { background - color : #F3F2F7 ; } . list { width : 95 % ; border - radius : 0.5 rem ; background - color : white ; margin : 1 rem auto ; } .

I'm looking for a string similarity algorithm that yields better results on variable length strings than the ones that are usually suggested (levenshtein distance, soundex, etc). For example, Given string A: "Robert", Then string B: "Amy Robertson" would be a better match than String C: "Richard" Also, preferably, this algorithm should be language agnostic (also works in languages other than English). Simon White of Catalysoft wrote an article about a very clever algorithm that compares adjacent character pairs that works really well for my purposes: http://www.catalysoft.com/articles