docs.rs failed to build stringmetrics-2.0.0
Please check the build logs for more information.
See Builds for ideas on how to fix a failed build, or Metadata for how to configure docs.rs builds.
If you believe this is docs.rs' fault, open an issue.
Please check the build logs for more information.
See Builds for ideas on how to fix a failed build, or Metadata for how to configure docs.rs builds.
If you believe this is docs.rs' fault, open an issue.
Visit the last successful build:
stringmetrics-2.2.2
Stringmetrics library
Stringmetrics
is a library for applying text- and token- based comparison
algorithms to determine the similarity of two strings or sets. It currently
includes a variety of implementations of Levenshtein
distance, Hamming
distance, and Jaccard
Similarity, with more string
metrics expected to be added in the future. It also includes helpful
tokenizers for things like splitting sentences into words.
[algorithms
] contains the basic string metrics. All of its functions are
re-exported here; please see [algorithms
] for further details.
The [tokenizers
] module is currently sparse, but will contain various
common methods of splitting strings up into words for further processing.
Example
use levenshtein;
assert_eq!;