14 lines
7.1 KiB
HTML
14 lines
7.1 KiB
HTML
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="This library implements string similarity metrics."><title>strsim - Rust</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-6b053e98.ttf.woff2,FiraSans-Italic-81dc35de.woff2,FiraSans-Regular-0fe48ade.woff2,FiraSans-MediumItalic-ccf7e434.woff2,FiraSans-Medium-e1aa3f0a.woff2,SourceCodePro-Regular-8badfe75.ttf.woff2,SourceCodePro-Semibold-aa29a496.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2"href="../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../static.files/normalize-9960930a.css"><link rel="stylesheet" href="../static.files/rustdoc-ca0dd0c4.css"><meta name="rustdoc-vars" data-root-path="../" data-static-root-path="../static.files/" data-current-crate="strsim" data-themes="" data-resource-suffix="" data-rustdoc-version="1.93.1 (01f6ddf75 2026-02-11) (Arch Linux rust 1:1.93.1-1)" data-channel="1.93.1" data-search-js="search-9e2438ea.js" data-stringdex-js="stringdex-a3946164.js" data-settings-js="settings-c38705f0.js" ><script src="../static.files/storage-e2aeef58.js"></script><script defer src="../crates.js"></script><script defer src="../static.files/main-a410ff4d.js"></script><noscript><link rel="stylesheet" href="../static.files/noscript-263c88ec.css"></noscript><link rel="alternate icon" type="image/png" href="../static.files/favicon-32x32-eab170b8.png"><link rel="icon" type="image/svg+xml" href="../static.files/favicon-044be391.svg"></head><body class="rustdoc mod crate"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><rustdoc-topbar><h2><a href="#">Crate strsim</a></h2></rustdoc-topbar><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../strsim/index.html">strsim</a><span class="version">0.11.1</span></h2></div><div class="sidebar-elems"><ul class="block"><li><a id="all-types" href="all.html">All Items</a></li></ul><section id="rustdoc-toc"><h3><a href="#enums">Crate Items</a></h3><ul class="block"><li><a href="#enums" title="Enums">Enums</a></li><li><a href="#functions" title="Functions">Functions</a></li><li><a href="#types" title="Type Aliases">Type Aliases</a></li></ul></section><div id="rustdoc-modnav"></div></div></nav><div class="sidebar-resizer" title="Drag to resize sidebar"></div><main><div class="width-limiter"><section id="main-content" class="content"><div class="main-heading"><h1>Crate <span>strsim</span> <button id="copy-path" title="Copy item path to clipboard">Copy item path</button></h1><rustdoc-toolbar></rustdoc-toolbar><span class="sub-heading"><a class="src" href="../src/strsim/lib.rs.html#1-1307">Source</a> </span></div><details class="toggle top-doc" open><summary class="hideme"><span>Expand description</span></summary><div class="docblock"><p>This library implements string similarity metrics.</p>
|
||
</div></details><h2 id="enums" class="section-header">Enums<a href="#enums" class="anchor">§</a></h2><dl class="item-table"><dt><a class="enum" href="enum.StrSimError.html" title="enum strsim::StrSimError">StrSim<wbr>Error</a></dt></dl><h2 id="functions" class="section-header">Functions<a href="#functions" class="anchor">§</a></h2><dl class="item-table"><dt><a class="fn" href="fn.damerau_levenshtein.html" title="fn strsim::damerau_levenshtein">damerau_<wbr>levenshtein</a></dt><dd>Like optimal string alignment, but substrings can be edited an unlimited
|
||
number of times, and the triangle inequality holds.</dd><dt><a class="fn" href="fn.generic_damerau_levenshtein.html" title="fn strsim::generic_damerau_levenshtein">generic_<wbr>damerau_<wbr>levenshtein</a></dt><dd>Like optimal string alignment, but substrings can be edited an unlimited
|
||
number of times, and the triangle inequality holds.</dd><dt><a class="fn" href="fn.generic_hamming.html" title="fn strsim::generic_hamming">generic_<wbr>hamming</a></dt><dd>Calculates the number of positions in the two sequences where the elements
|
||
differ. Returns an error if the sequences have different lengths.</dd><dt><a class="fn" href="fn.generic_jaro.html" title="fn strsim::generic_jaro">generic_<wbr>jaro</a></dt><dd>Calculates the Jaro similarity between two sequences. The returned value
|
||
is between 0.0 and 1.0 (higher value means more similar).</dd><dt><a class="fn" href="fn.generic_jaro_winkler.html" title="fn strsim::generic_jaro_winkler">generic_<wbr>jaro_<wbr>winkler</a></dt><dd>Like Jaro but gives a boost to sequences that have a common prefix.</dd><dt><a class="fn" href="fn.generic_levenshtein.html" title="fn strsim::generic_levenshtein">generic_<wbr>levenshtein</a></dt><dd>Calculates the minimum number of insertions, deletions, and substitutions
|
||
required to change one sequence into the other.</dd><dt><a class="fn" href="fn.hamming.html" title="fn strsim::hamming">hamming</a></dt><dd>Calculates the number of positions in the two strings where the characters
|
||
differ. Returns an error if the strings have different lengths.</dd><dt><a class="fn" href="fn.jaro.html" title="fn strsim::jaro">jaro</a></dt><dd>Calculates the Jaro similarity between two strings. The returned value
|
||
is between 0.0 and 1.0 (higher value means more similar).</dd><dt><a class="fn" href="fn.jaro_winkler.html" title="fn strsim::jaro_winkler">jaro_<wbr>winkler</a></dt><dd>Like Jaro but gives a boost to strings that have a common prefix.</dd><dt><a class="fn" href="fn.levenshtein.html" title="fn strsim::levenshtein">levenshtein</a></dt><dd>Calculates the minimum number of insertions, deletions, and substitutions
|
||
required to change one string into the other.</dd><dt><a class="fn" href="fn.normalized_damerau_levenshtein.html" title="fn strsim::normalized_damerau_levenshtein">normalized_<wbr>damerau_<wbr>levenshtein</a></dt><dd>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.</dd><dt><a class="fn" href="fn.normalized_levenshtein.html" title="fn strsim::normalized_levenshtein">normalized_<wbr>levenshtein</a></dt><dd>Calculates a normalized score of the Levenshtein algorithm between 0.0 and
|
||
1.0 (inclusive), where 1.0 means the strings are the same.</dd><dt><a class="fn" href="fn.osa_distance.html" title="fn strsim::osa_distance">osa_<wbr>distance</a></dt><dd>Like Levenshtein but allows for adjacent transpositions. Each substring can
|
||
only be edited once.</dd><dt><a class="fn" href="fn.sorensen_dice.html" title="fn strsim::sorensen_dice">sorensen_<wbr>dice</a></dt><dd>Calculates a Sørensen-Dice similarity distance using bigrams.
|
||
See <a href="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>.</dd></dl><h2 id="types" class="section-header">Type Aliases<a href="#types" class="anchor">§</a></h2><dl class="item-table"><dt><a class="type" href="type.HammingResult.html" title="type strsim::HammingResult">Hamming<wbr>Result</a></dt></dl></section></div></main></body></html> |