edits: show the differences between 2 pieces of Text using the Levenshtein distance

[ control, data, library, mit ] [ Propose Tags ]

This library computes the minimum number of edit operations insert, delete, substitute which are necessary to transform a piece of text into another. It then displays the parts which are different in brackets.

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.0.1, 0.1.1.0
Dependencies base (>=4.14 && <5), containers (>=0.2 && <1), matrix (>=0.3 && <1), primitive (>=0.6 && <1), protolude (>=0.3 && <0.4), text (>=1 && <2), vector (>=0.10 && <2) [details]
License MIT
Author
Maintainer etorreborre@yahoo.com
Category Data
Source repo head: git clone https://github.com/etorreborre/edits
Uploaded by etorreborre at 2022-09-24T13:25:49Z
Distributions NixOS:0.1.1.0
Downloads 46 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]