liblevenshtein-cpp/merge__and__split__distance_8h_source.html

#ifndef LIBLEVENSHTEIN_DISTANCE_MERGE_AND_SPLIT_DISTANCE_H

#define LIBLEVENSHTEIN_DISTANCE_MERGE_AND_SPLIT_DISTANCE_H


#include <string>


#include "liblevenshtein/distance/memoized_distance.h"


namespace liblevenshtein::distance {


class MergeAndSplitDistance : public MemoizedDistance {

public:


  auto between(std::string v, std::string w) -> std::size_t override;

};


} // namespace liblevenshtein::distance


#endif // LIBLEVENSHTEIN_DISTANCE_MERGE_AND_SPLIT_DISTANCE_H

liblevenshtein::distance::MemoizedDistance
Memoizes the distance between pairs of terms.
Definition memoized_distance.h:16

liblevenshtein::distance::MergeAndSplitDistance
Computes the standard Levenshtein distance extended with two additional elementary operations: (1) me...
Definition merge_and_split_distance.h:15

liblevenshtein::distance::MergeAndSplitDistance::between
auto between(std::string v, std::string w) -> std::size_t override
Measures the edit distance between two terms.
Definition merge_and_split_distance.cpp:6

query
void query(ll::Dawg *dawg, const std::string &query_term, std::size_t max_distance)
Definition main.cpp:25

memoized_distance.h

liblevenshtein::distance
Memoized, recursive distance metrics typically used to evaluate the correctness of Levenshtein automa...
Definition namespaces.dox:16