php - PHP最近的字符串比较

Question

可能重复：
PHP 中的字符串相似性：用于长字符串的 levenshtein 类似函数

我有我的主题字符串

$subj = "Director, My Company";

以及要比较的多个字符串的列表：

$str1 = "Foo bar";
$str2 = "Lorem Ipsum";
$str3 = "Director";

我想在这里实现的是找到与$subj. 有可能做到吗？

Answer 1

该levenshtein()功能将执行您的预期。Levenshtein 算法计算将某个字符串转换为另一个字符串所需的插入和替换操作的数量。结果称为edit distance. 距离可用于根据您的要求比较字符串。

此示例源自 PHPlevenshtein()函数的文档。

<?php

$input = 'Director, My Company';

// array of words to check against
$words  = array('Foo bar','Lorem Ispum','Director');

// no shortest distance found, yet
$shortest = -1;

// loop through words to find the closest
foreach ($words as $word) {

    // calculate the distance between the input word,
    // and the current word
    $lev = levenshtein($input, $word);

    // check for an exact match
    if ($lev == 0) {

        // closest word is this one (exact match)
        $closest = $word;
        $shortest = 0;

        // break out of the loop; we've found an exact match
        break;
    }

    // if this distance is less than the next found shortest
    // distance, OR if a next shortest word has not yet been found
    if ($lev <= $shortest || $shortest < 0) {
        // set the closest match, and shortest distance
        $closest  = $word;
        $shortest = $lev;
    }
}

echo "Input word: $input\n";
if ($shortest == 0) {
    echo "Exact match found: $closest\n";
} else {
    echo "Did you mean: $closest?\n";
}

脚本输出是

Input word: Director, My Company
Did you mean: Director?

祝你好运！

Answer 2

您可以使用http://php.net/manual/en/function.levenshtein.php来确定两个字符串之间的距离。

$subj = "Director, My Company";
$str = array();
$str[] = "Foo bar";
$str[] = "Lorem Ipsum";
$str[] = "Director";

$minStr = "";
$minDis = PHP_INT_MAX;
for ($str as $curStr) {
  $dis = levenshtein($subj, $curStr);
  if ($dis < $minDis) {
    $minDis = $dis;
    $minStr = $curStr;
  }
}
echo($minStr);