Customize levenshtein Purpose: Understand the principle of levenshtein algorithm
Release： 2016-07-25 09:01:25
Original
1307 people have browsed it
参考 ：
http://www.cnblogs.com/ymind/archive/2012/03/27/fast-memory-efficient-Levenshtein-algorithm.html
- function _levenshtein($src, $dst){
- if (empty($src)) {
- return $dst;
- }
- if (empty($dst)) {
- return $src;
- }
-
- $temp = array();
-
- for($i = 0; $i <= strlen($src); $i++) {
- $temp[$i][0] = $i;
- }
- for($j = 0; $j <= strlen($dst); $j++) {
- $temp[0][$j] = $j;
- }
- for ($i = 1;$i <= strlen($src); $i++) {
-
- $src_i = $src{$i - 1};
-
- for ($j = 1; $j <= strlen($dst); $j++) {
-
- $dst_j = $dst{$j - 1};
-
- if ($src_i == $dst_j) {
- $cost = 0;
- } else {
- $cost = 1;
- }
- $temp[$i][$j] = min($temp[$i-1][$j]+1, $temp[$i][$j-1]+1, $temp[$i-1][$j-1] + $cost);
- }
-
- }
- return $temp[$i-1][$j-1];
- }
-
- echo _levenshtein("hello", "HElloo");
|
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Latest Articles by Author
-
2024-10-22 09:46:29
-
2024-10-13 13:53:41
-
2024-10-12 12:15:51
-
2024-10-11 22:47:31
-
2024-10-11 19:36:51
-
2024-10-11 15:50:41
-
2024-10-11 15:07:41
-
2024-10-11 14:21:21
-
2024-10-11 12:59:11
-
2024-10-11 12:17:31
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
