</div></details><h2id="enums"class="section-header">Enums<ahref="#enums"class="anchor">§</a></h2><ulclass="item-table"><li><divclass="item-name"><aclass="enum"href="enum.StrSimError.html"title="enum strsim::StrSimError">StrSimError</a></div></li></ul><h2id="functions"class="section-header">Functions<ahref="#functions"class="anchor">§</a></h2><ulclass="item-table"><li><divclass="item-name"><aclass="fn"href="fn.damerau_levenshtein.html"title="fn strsim::damerau_levenshtein">damerau_levenshtein</a></div><divclass="desc docblock-short">Like optimal string alignment, but substrings can be edited an unlimited
number of times, and the triangle inequality holds.</div></li><li><divclass="item-name"><aclass="fn"href="fn.generic_damerau_levenshtein.html"title="fn strsim::generic_damerau_levenshtein">generic_damerau_levenshtein</a></div><divclass="desc docblock-short">Like optimal string alignment, but substrings can be edited an unlimited
number of times, and the triangle inequality holds.</div></li><li><divclass="item-name"><aclass="fn"href="fn.generic_hamming.html"title="fn strsim::generic_hamming">generic_hamming</a></div><divclass="desc docblock-short">Calculates the number of positions in the two sequences where the elements
differ. Returns an error if the sequences have different lengths.</div></li><li><divclass="item-name"><aclass="fn"href="fn.generic_jaro.html"title="fn strsim::generic_jaro">generic_jaro</a></div><divclass="desc docblock-short">Calculates the Jaro similarity between two sequences. The returned value
is between 0.0 and 1.0 (higher value means more similar).</div></li><li><divclass="item-name"><aclass="fn"href="fn.generic_jaro_winkler.html"title="fn strsim::generic_jaro_winkler">generic_jaro_winkler</a></div><divclass="desc docblock-short">Like Jaro but gives a boost to sequences that have a common prefix.</div></li><li><divclass="item-name"><aclass="fn"href="fn.generic_levenshtein.html"title="fn strsim::generic_levenshtein">generic_levenshtein</a></div><divclass="desc docblock-short">Calculates the minimum number of insertions, deletions, and substitutions
required to change one sequence into the other.</div></li><li><divclass="item-name"><aclass="fn"href="fn.hamming.html"title="fn strsim::hamming">hamming</a></div><divclass="desc docblock-short">Calculates the number of positions in the two strings where the characters
differ. Returns an error if the strings have different lengths.</div></li><li><divclass="item-name"><aclass="fn"href="fn.jaro.html"title="fn strsim::jaro">jaro</a></div><divclass="desc docblock-short">Calculates the Jaro similarity between two strings. The returned value
is between 0.0 and 1.0 (higher value means more similar).</div></li><li><divclass="item-name"><aclass="fn"href="fn.jaro_winkler.html"title="fn strsim::jaro_winkler">jaro_winkler</a></div><divclass="desc docblock-short">Like Jaro but gives a boost to strings that have a common prefix.</div></li><li><divclass="item-name"><aclass="fn"href="fn.levenshtein.html"title="fn strsim::levenshtein">levenshtein</a></div><divclass="desc docblock-short">Calculates the minimum number of insertions, deletions, and substitutions
required to change one string into the other.</div></li><li><divclass="item-name"><aclass="fn"href="fn.normalized_damerau_levenshtein.html"title="fn strsim::normalized_damerau_levenshtein">normalized_damerau_levenshtein</a></div><divclass="desc docblock-short">Calculates a normalized score of the Damerau–Levenshtein algorithm between
0.0 and 1.0 (inclusive), where 1.0 means the strings are the same.</div></li><li><divclass="item-name"><aclass="fn"href="fn.normalized_levenshtein.html"title="fn strsim::normalized_levenshtein">normalized_levenshtein</a></div><divclass="desc docblock-short">Calculates a normalized score of the Levenshtein algorithm between 0.0 and
1.0 (inclusive), where 1.0 means the strings are the same.</div></li><li><divclass="item-name"><aclass="fn"href="fn.osa_distance.html"title="fn strsim::osa_distance">osa_distance</a></div><divclass="desc docblock-short">Like Levenshtein but allows for adjacent transpositions. Each substring can
only be edited once.</div></li><li><divclass="item-name"><aclass="fn"href="fn.sorensen_dice.html"title="fn strsim::sorensen_dice">sorensen_dice</a></div><divclass="desc docblock-short">Calculates a Sørensen-Dice similarity distance using bigrams.
See <ahref="https://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient">https://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient</a>.</div></li></ul><h2id="types"class="section-header">Type Aliases<ahref="#types"class="anchor">§</a></h2><ulclass="item-table"><li><divclass="item-name"><aclass="type"href="type.HammingResult.html"title="type strsim::HammingResult">HammingResult</a></div></li></ul></section></div></main></body></html>
