54 const std::string a =
"kitten";
55 const std::string b =
"sitting";
57 std::cout <<
"Levenshtein Example\n";
58 std::cout <<
"a = " << a <<
"\n";
59 std::cout <<
"b = " << b <<
"\n";
Dynamic-programming algorithms for string similarity and alignment.
int main()
Example program that computes and prints the Levenshtein distance.
Main namespace for Aleph-w library functions.
size_t levenshtein_distance(const std::string_view a, const std::string_view b)
Levenshtein distance (insert/delete/substitute each cost 1).