Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the mk-string-metrics Reference Manual, version 0.1.2, generated automatically by Declt version 4.0 beta 2 "William Riker" on Thu Sep 15 05:40:20 2022 GMT+0.
Next: Systems, Previous: The mk-string-metrics Reference Manual, Up: The mk-string-metrics Reference Manual [Contents][Index]
This library implements efficient algorithms that calculate various string metrics in Common Lisp:
Copy files of this library in any place where ASDF can find them. Then you can use it in system definitions and ASDF will take care of the rest.
Via Quicklisp (recommended):
(ql:quickload "mk-string-metrics")
damerau-levenshtein x y
Calculate Damerau-Levenshtein distance between two given strings x
and
y
.
hamming x y
Calculate Hamming distance between two given strings x
and y
, they have
to be of the same length.
jaccard x y
Calculate Jaccard similarity coefficient for two strings x
and y
.
Returned value is in range from 0
(no similarity) to 1
(exact match).
jaro x y
Calculate Jaro distance between two strings x
and y
. Returned value is
in range from 0
(no similarity) to 1
(exact match).
jaro-winkler x y
Calculate Jaro-Winkler distance between two strings x
and y
. Returned
value is in range from 0
(no similarity) to 1
(exact match).
levenshtein x y
Calculate Levenshtein distance between two given strings x
and y
.
norm-damerau-levenshtein x 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.
norm-levenshtein x y
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.
overlap x y
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).
Copyright © 2014–2018 Mark Karpov
Distributed under MIT Licens
Next: Files, Previous: Introduction, Up: The mk-string-metrics Reference Manual [Contents][Index]
The main system appears first, followed by any subsystem dependency.
efficient implementations of various string metric algorithms
Mark Karpov
MIT
0.1.2
mk-string-metrics.lisp (file).
Next: Packages, Previous: Systems, Up: The mk-string-metrics Reference Manual [Contents][Index]
Files are sorted by type and then listed depth-first from the systems components trees.
Next: mk-string-metrics/mk-string-metrics.lisp, Previous: Lisp, Up: Lisp [Contents][Index]
mk-string-metrics (system).
Previous: mk-string-metrics/mk-string-metrics.asd, Up: Lisp [Contents][Index]
mk-string-metrics (system).
Next: Definitions, Previous: Files, Up: The mk-string-metrics Reference Manual [Contents][Index]
Packages are listed by definition order.
mksm
common-lisp.
Next: Indexes, Previous: Packages, Up: The mk-string-metrics Reference Manual [Contents][Index]
Definitions are sorted by export status, category, package, and then by lexicographic order.
Next: Internals, Previous: Definitions, Up: Definitions [Contents][Index]
Previous: Public Interface, Up: Public Interface [Contents][Index]
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).
Previous: Public Interface, Up: Definitions [Contents][Index]
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.
Previous: Ordinary functions, Up: Internals [Contents][Index]
Previous: Definitions, Up: The mk-string-metrics Reference Manual [Contents][Index]
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 |
---|