Smart string comparator that uses simple string comparison, and then the levenshtein algorithm to compare two strings. More...
Public Member Functions | |
getSimilarity ( $a, $b) | |
Compares the two messages and returns a similarity percentage. | |
levenshtein (string $str1, string $str2, int $length1, int $length2) | |
PHP implementation of Levenshtein edit distance algorithm. | |
Smart string comparator that uses simple string comparison, and then the levenshtein algorithm to compare two strings.
Definition at line 13 of file EditDistanceStringComparator.php.
MediaWiki\Extension\Translate\Utilities\StringComparators\EditDistanceStringComparator::__construct | ( | ) |
Definition at line 16 of file EditDistanceStringComparator.php.
MediaWiki\Extension\Translate\Utilities\StringComparators\EditDistanceStringComparator::getSimilarity | ( | $a, | |
$b ) |
Compares the two messages and returns a similarity percentage.
string | $a | |
string | $b |
Implements MediaWiki\Extension\Translate\Utilities\StringComparators\StringComparator.
Definition at line 20 of file EditDistanceStringComparator.php.
MediaWiki\Extension\Translate\Utilities\StringComparators\EditDistanceStringComparator::levenshtein | ( | string | $str1, |
string | $str2, | ||
int | $length1, | ||
int | $length2 ) |
PHP implementation of Levenshtein edit distance algorithm.
Uses the native PHP implementation when possible for speed. The native levenshtein is limited to 255 bytes.
Definition at line 40 of file EditDistanceStringComparator.php.