module Edits::DamerauLevenshtein

Overview

Implemention of the Damerau/Levenshtein distance algorithm.

Determines distance between two strings by counting edits, identifying:

Defined in:

edits/damerau_levenshtein.cr

Class Method Summary

Class Method Detail

def self.distance(str1, str2) #

Calculate the Damerau/Levenshtein distance of two sequences.

DamerauLevenshtein.distance('acer', 'earn') # => 3


[View source]