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
|
/* SPDX-License-Identifier: MIT */
/* Copyright © 2022-present Max Bachmann */
#pragma once
#include "Levenshtein.hpp"
#include <limits>
namespace rapidfuzz_reference {
template <typename InputIt1, typename InputIt2>
size_t indel_distance(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2,
size_t score_cutoff = std::numeric_limits<size_t>::max())
{
return levenshtein_distance(first1, last1, first2, last2, {1, 1, 2}, score_cutoff);
}
template <typename Sentence1, typename Sentence2>
size_t indel_distance(const Sentence1& s1, const Sentence2& s2,
size_t score_cutoff = std::numeric_limits<size_t>::max())
{
return levenshtein_distance(s1, s2, {1, 1, 2}, score_cutoff);
}
template <typename InputIt1, typename InputIt2>
double indel_similarity(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2,
double score_cutoff = 0.0)
{
return levenshtein_similarity(first1, last1, first2, last2, {1, 1, 2}, score_cutoff);
}
template <typename Sentence1, typename Sentence2>
double indel_similarity(const Sentence1& s1, const Sentence2& s2, double score_cutoff = 0.0)
{
return levenshtein_similarity(s1, s2, {1, 1, 2}, score_cutoff);
}
} // namespace rapidfuzz_reference
|
