This is the mk-string-metrics Reference Manual, version 0.1.2, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon May 15 05:55:39 2023 GMT+0.
The main system appears first, followed by any subsystem dependency.
mk-string-metricsefficient implementations of various string metric algorithms
Mark Karpov
MIT
0.1.2
mk-string-metrics.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
mk-string-metrics/mk-string-metrics.asdmk-string-metrics (system).
mk-string-metrics/mk-string-metrics.lispmk-string-metrics (system).
damerau-levenshtein (function).
hamming (function).
jaccard (function).
jaro (function).
jaro-winkler (function).
levenshtein (function).
norm-damerau-levenshtein (function).
norm-levenshtein (function).
overlap (function).
array-index (type).
fast-find (function).
intersection-length (function).
prefix-length (function).
string-to-set (function).
union-length (function).
Packages are listed by definition order.
mk-string-metricsmksm
common-lisp.
damerau-levenshtein (function).
hamming (function).
jaccard (function).
jaro (function).
jaro-winkler (function).
levenshtein (function).
norm-damerau-levenshtein (function).
norm-levenshtein (function).
overlap (function).
array-index (type).
fast-find (function).
intersection-length (function).
prefix-length (function).
string-to-set (function).
union-length (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Calculate Damerau-Levenshtein distance between two given strings X and Y.
Calculate Hamming distance between two given strings X and Y, they have to be of the same length.
Calculate Jaccard similarity coefficient for two strings X and
Y. Returned value is in range from 0 (no similarity) to 1 (exact match).
Calculate Jaro distance between two strings X and Y. Returned value is in range from 0 (no similarity) to 1 (exact match).
Calculate Jaro-Winkler distance between two strings X and Y. Returned value is in range from 0 (no similarity) to 1 (exact match).
Calculate Levenshtein distance between two given strings X and Y.
Return normalized Damerau-Levenshtein distance between X and Y. Result is a real number from 0 to 1, where 0 signifies no similarity between the strings, while 1 means exact match.
Return normalized Levenshtein distance between X and Y. Result is a real number from 0 to 1, where 0 signifies no similarity between the strings, while 1 means exact match.
This function calculates overlap coefficient between two given strings X and Y. Returned value is in range from 0 (no similarity) to 1 (exact match).
Check if CHAR is in STR. This function is supposed to be inlined.
Returns length of intersection of two strings X and Y. This function is supposed to be inlined.
Calculate length of common prefix for strings X and Y.
Convert string STR into a set. This function is supposed to be inlined.
Returns length of union of two strings X and Y. This function is supposed to be inlined.
| Jump to: | D F H I J L N O P S U |
|---|
| Jump to: | D F H I J L N O P S U |
|---|
| Jump to: | A F M P S T |
|---|
| Jump to: | A F M P S T |
|---|