levenshtein.h File Reference

#include <stdexcept>
#include <algorithm>
#include <string>
#include <vector>

Go to the source code of this file.

Namespaces
namespace	clanguml
namespace	clanguml::util

Functions
size_t	clanguml::util::levenshtein_distance (const std::string &left, const std::string &right)
	Compute the Levenshtein distance between two strings.
std::vector< std::string >	clanguml::util::get_approximate_matches (const std::vector< std::string > &collection, const std::string &pattern, int max_results=3)
	Find most similar strings in collection.