ml

metric-lcs

Zero dependency Metric Longest Common Subsequence implementation in js.

Showing:

Popularity

Downloads/wk

18.5K

GitHub Stars

1

Maintenance

Last Commit

4yrs ago

Contributors

0

Package

Dependencies

0

Size (min+gzip)

0.3KB

License

MIT

Type Definitions

Tree-Shakeable

No?

Categories

Readme

metric-lcs

Zero dependency Metric Longest Common Subsequence implementation in js.

Usage

npm i metric-lcs

const metriclcs = require("metric-lcs");
console.log(metriclcs("ABDEF", "ABDIF")); //.8

Use case

Longest Common Subsequence is used with diff, so the metric version of it is suitable for comparing larger strings or for comparing likely subsets of strings since it ignores edit distance and lowers the cost of insertion.

Thanks

Special thanks to tdebatty for java-string-similarity, which I used as a reference implementation.

Rate & Review

Great Documentation0
Easy to Use0
Performant0
Highly Customizable0
Bleeding Edge0
Responsive Maintainers0
Poor Documentation0
Hard to Use0
Slow0
Buggy0
Abandoned0
Unwelcoming Community0
100
No reviews found
Be the first to rate

Alternatives

No alternatives found

Tutorials

No tutorials found
Add a tutorial