这可以计算两个字符串之间的相似度，如 Oliver 的《编程经典：实现世界最佳算法》（ISBN 0-131-00413-1）中所述。请注意，此实现并不像奥利弗的伪代码中那样使用堆栈，而是使用递归调用，这可能会也可能不会加速整个过程。另请注意，该算法的复杂度为 O(N**3)，其中 N 是最长字符串的长度...
This calculates the similarity between two strings as described in Programming Classics: Implementing the World's Best Algorithms by Oliver (ISBN 0-131-00413-1). Note that this implementation does not use a stack as in Oliver's pseudo code, but recursive calls which may or may not speed up the whole process. Note also that the complexity of this algorithm is O(N**3) where N is the length of the longest string...
Also, if you're doing this comparison as a part of a data extraction from a database, many DB engines have a SOUNDS LIKE (or SOUNDEX) implementation. Doing this in the DB server would be faster than doing it in PHP.
发布评论
评论（4）
http://www.php.net/manual/en/function。相似文本.php
正是如此。
http://www.php.net/manual/en/function.similar-text.php
Does exactly that.
您可以考虑使用 levenshtein，相似文本, soundex，或 变音功能。
You might consider using the levenshtein, similar-text, soundex, or metaphone functions.
另外，如果您将这种比较作为从数据库提取数据的一部分进行，则许多数据库引擎都有 SOUNDS LIKE（或 SOUNDEX）实现。在数据库服务器中执行此操作比在 PHP 中执行此操作更快。
Also, if you're doing this comparison as a part of a data extraction from a database, many DB engines have a SOUNDS LIKE (or SOUNDEX) implementation. Doing this in the DB server would be faster than doing it in PHP.