efficient implementations of various string metric algorithms

mk-string-metrics

# mk-string-metrics

[![License MIT](https://img.shields.io/badge/license-MIT-green.svg)](http://opensource.org/licenses/MIT)
[![Build Status](https://travis-ci.org/mrkkrp/mk-string-metrics.svg?branch=master)](https://travis-ci.org/mrkkrp/mk-string-metrics)
[![Quicklisp](http://quickdocs.org/badge/mk-string-metrics.svg)](http://quickdocs.org/mk-string-metrics/)

This library implements efficient algorithms that calculate various string
metrics in Common Lisp:

* [Damerau-Levenshtein
  distance](http://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance)
* [Hamming distance](http://en.wikipedia.org/wiki/Hamming_distance)
* [Jaccard similarity
  coefficient](http://en.wikipedia.org/wiki/Jaccard_index)
* [Jaro
  distance](http://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance)
* [Jaro-Winkler
  distance](http://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance)
* [Levenshtein distance](http://en.wikipedia.org/wiki/Levenshtein_distance)
* [Normalized Damerau-Levenshtein
  distance](http://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance)
* [Normalized Levenshtein
  distance](http://en.wikipedia.org/wiki/Levenshtein_distance)
* [Overlap coefficient](http://en.wikipedia.org/wiki/Overlap_coefficient)

## Installation

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):

```common-lisp
(ql:quickload "mk-string-metrics")
```

## Documentation

```
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).

## License

Copyright © 2014–2018 Mark Karpov

Distributed under MIT License.


mk-string-metrics

Upstream URL

Author

License

mk-string-metrics

Version:

License:

Authors:

Dependencies:

mk-string-metrics-tests

Version:

License:

Authors:

Dependencies:

Dependencies (0)

Dependents (1)