1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/* SPDX-License-Identifier: MIT */
/* Copyright © 2022-present Max Bachmann */
#pragma once
#include "common.hpp"
#include <algorithm>
#include <cstddef>
#include <limits>
#include <vector>
namespace rapidfuzz_reference {
struct LevenshteinWeightTable {
size_t insert_cost;
size_t delete_cost;
size_t replace_cost;
};
template <typename InputIt1, typename InputIt2>
Matrix<size_t> levenshtein_matrix(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2,
LevenshteinWeightTable weights = {1, 1, 1})
{
size_t len1 = static_cast<size_t>(std::distance(first1, last1));
size_t len2 = static_cast<size_t>(std::distance(first2, last2));
Matrix<size_t> matrix(len1 + 1, len2 + 1);
for (size_t i = 0; i <= len1; ++i)
matrix(i, 0) = i * weights.delete_cost;
for (size_t i = 0; i <= len2; ++i)
matrix(0, i) = i * weights.insert_cost;
for (size_t pos1 = 0; pos1 < len1; ++pos1) {
for (size_t pos2 = 0; pos2 < len2; ++pos2) {
size_t cost = (first1[pos1] == first2[pos2]) ? 0 : weights.replace_cost;
matrix(pos1 + 1, pos2 + 1) =
std::min({matrix(pos1, pos2 + 1) + weights.delete_cost,
matrix(pos1 + 1, pos2) + weights.insert_cost, matrix(pos1, pos2) + cost});
}
}
return matrix;
}
template <typename Sentence1, typename Sentence2>
Matrix<size_t> levenshtein_matrix(const Sentence1& s1, const Sentence2& s2,
LevenshteinWeightTable weights = {1, 1, 1})
{
return levenshtein_matrix(std::begin(s1), std::end(s1), std::begin(s2), std::end(s2), weights);
}
template <typename InputIt1, typename InputIt2>
size_t levenshtein_distance(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2,
LevenshteinWeightTable weights = {1, 1, 1},
size_t score_cutoff = std::numeric_limits<size_t>::max())
{
auto matrix = levenshtein_matrix(first1, last1, first2, last2, weights);
size_t dist = matrix.back();
return (dist <= score_cutoff) ? dist : score_cutoff + 1;
}
template <typename Sentence1, typename Sentence2>
size_t levenshtein_distance(const Sentence1& s1, const Sentence2& s2,
LevenshteinWeightTable weights = {1, 1, 1},
size_t score_cutoff = std::numeric_limits<size_t>::max())
{
return levenshtein_distance(std::begin(s1), std::end(s1), std::begin(s2), std::end(s2), weights,
score_cutoff);
}
} // namespace rapidfuzz_reference
|
